Letchford, A N and Lysgaard, J and Eglese, R W (2006) A branch-and-cut algorithm for the capacitated open vehicle routing problem. Working Paper. The Department of Management Science, Lancaster University.Full text not available from this repository.
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.
|Item Type:||Monograph (Working Paper)|
|Additional Information:||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.|
|Uncontrolled Keywords:||vehicle routing ; branch-and-cut ; separation|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||11 Jul 2011 22:15|
|Last Modified:||23 Apr 2017 00:15|
Actions (login required)