Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cor.2013.09.009 | Computers & Operations Research |
Keywords | DocType | Volume |
optimal solution,heuristic solution method,original schedule,new schedule,computational experiment,capacitated vehicle,routing schedule,average demand,two-phase heuristic,rescheduling problem,satisfiability,mathematical programming,vehicle routing | Journal | 43, |
ISSN | Citations | PageRank |
0305-0548 | 4 | 0.43 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Remy Spliet | 1 | 31 | 3.69 |
| Adriana F. Gabor | 2 | 48 | 4.56 |
| Rommert Dekker | 3 | 763 | 101.60 |