Solving Large-Scale Multiple-Depot Vehicle Scheduling Problems

Please always quote using this URN: urn:nbn:de:0297-zib-2866
  • This paper presents an integer linear programming approach with delayed column generation for the {\em NP} Multiple-Depot Vehicle Scheduling Problem (MDVSP) in public mass transit. We describe in detail all basic ingredients of our approach that are indispensable to solve truly large-scale real-world instances to optimality, and we report on computational investigations that are based on real-world instances from the city of Berlin, the city of Hamburg, and the region around Hamburg. These real-world instances have up to 25 thousand timetabled trips and 70 million dead-head trips. Computational tests using the data of the Hamburger Hochbahn AG indicate savings of several vehicles and a cost reduction of about 10\% compared with the solution provided by HOT II, the vehicle scheduling tool of the HanseCom GmbH, Hamburg. Parts of our algorithms are already integrated in the BERTA system of the Berliner Verkehrsbetriebe (BVG) and will soon be integrated in the MICROBUS system of the Gesellschaft für Informatik, Verkehrs- und Umweltplanung mbH (IVU), Berlin.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Andreas Löbel
Document Type:ZIB-Report
Date of first Publication:1997/04/22
Series (Serial Number):ZIB-Report (SC-97-17)
ZIB-Reportnumber:SC-97-17
Published in:Appeared in: Nigel H. M. Wilson (ed.) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems. Springer, 1999 pp. 193-220