Research output: Working paper
Research output: Working paper
}
TY - UNPB
T1 - A branch-and-cut algorithm for the capacitated open vehicle routing problem
AU - Letchford, A N
AU - Lysgaard, J
AU - Eglese, R W
N1 - This was eventually published as: A.N. Letchford, J. Lysgaard & R.W. Eglese (2007) A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Opl Res. Soc., 58(12), 1642-1651.
PY - 2006
Y1 - 2006
N2 - In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem.
AB - In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem.
KW - vehicle routing
KW - branch-and-cut
KW - separation
M3 - Working paper
T3 - Management Science Working Paper Series
BT - A branch-and-cut algorithm for the capacitated open vehicle routing problem
PB - The Department of Management Science
CY - Lancaster University
ER -