Application of the Branch and Cut Method to the Vehicle Routing Problem

Blasum, Ulrich and Hochstättler, Winfried (2000) Application of the Branch and Cut Method to the Vehicle Routing Problem.
Technical Report , 20 p.

Abstract

The successful application of Branch and Cut methods to the TSP has drawn attention also to the polyhedral properties of the symmetric capacitated vehicle routing problem, which is the capacitated counterpart of the TSP. We investigate three classes of valid inequalities for the CVRP, multistars, pathbin inequalities and hypotours and give computational results we obtained with a Branch and Cut implementation.


Actions:
Download: [img] Postscript
Download (382Kb) | Preview
Download: [img] PDF
Download (332Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Paper (Technical Report)
Citations: 45 (Google Scholar) |
Uncontrolled Keywords: branch-and-cut vehicle routing
Subjects:
Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
Mathematical Institute > Prof. Dr. Faigle
Related URLs:
Deposit Information:
ZAIK Number: zaik2000-386
Depositing User: Ulrich Blasum
Date Deposited: 15 May 2002 00:00
Last Modified: 16 Jan 2012 13:39
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/386