.png){kind=icon}
.png){kind=icon}
Return
The vehicle rescheduling problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2013.09.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The capacitated vehicle routing problem (CVRP) is the problem of finding a routing schedule to satisfy demand by supplying goods stored at the depot, such that the traveling costs are minimized. For operational purposes, in many practical applications a long term routing schedule is made, often based on average demand. When demand substantially differs from the average, constructing a new schedule is beneficial. The vehicle rescheduling problem (VRSP) is the problem of finding a new schedule that not only minimizes the total traveling costs but also minimizes the costs of deviating from the original schedule. In this paper a mathematical programming formulation of the rescheduling problem is presented as well as a heuristic solution method referred to as the two-phase heuristic. We provide sufficiency conditions for which it produces the optimal solution. Finally, we perform computational experiments to study the performance of the two-phase heuristic. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Vehicle routing
Rescheduling
Operational planning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W