European Business Schools Librarian's Group
CORAL Working Papers,
University of Aarhus, Aarhus School of Business, Department of Business Studies
No L-2006-06: A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Adam N. Letchford (), Jens Lysgaard () and Richard W. Eglese ()
Additional contact information
Adam N. Letchford: Department of Management Science, Postal: University of Lancaster, Lancaster LA1 4YW, England,
Jens Lysgaard: Department of Business Studies, Postal: The Aarhus School of Business, Fuglesangs Allé 4, 8210 Aarhus V, Denmark
Richard W. Eglese: Department of Management Science, Postal: University of Lancaster, Lancaster LA1 4YW, England,
Abstract: 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.
Keywords: Vehicle routing; branch-and-cut; separation
24 pages, April 26, 2006
Full text files
L_2006_06.pdf
- University of Aarhus, Aarhus School of Business, Department of Business Studies
- Home page for this series
Questions (including download problems) about the papers in this series should be directed to Helle Vinbaek Stenholt ()
Report other problems with accessing this service to Sune Karlsson ().
RePEc:hhb:aarbls:2006-006This page generated on 2024-09-13 22:19:08.