Anwendung des Branch&Cut Verfahrens auf das kapazitierte Vehicle Routing Problem

Blasum, Ulrich (2000) Anwendung des Branch&Cut Verfahrens auf das kapazitierte Vehicle Routing Problem. PhD thesis.

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. In this PhD-theses several classes of valid inequalities for the CVRP, like multistars, pathbin inequalities and hypotours are investigated. We also give computational results we obtained with a Branch and Cut implementation. We were able to solve two of the difficult 76-node benchmarks from Eilon to optimality.


Actions:
Download: [img] Postscript - Accepted Version
Download (1751Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Thesis (PhD)
Citations: No citation data.
Uncontrolled Keywords:
Subjects:
Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
Related URLs:
    Deposit Information:
    ZAIK Number: zaik2000-380
    Depositing User: Ulrich Blasum
    Date Deposited: 02 Apr 2001 00:00
    Last Modified: 19 Dec 2011 09:45
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/380