Abstract
We compare the linear programming relaxation of different mathematical formulations for the multi-depot vehicle scheduling problem. As a result of this theoretical analysis, we select for development a tree search procedure based on a multicommodity network flow formulation that involves two different types of decision variables: one type is used to describe the connections between trips, in order to obtain the vehicle blocks, while the other type is related to the assignment of trips to depots. We also develop a branch and bound algorithm based on the linear relaxation of a more compact multicommodity network flow formulation, in the sense that it contains just one type of variable and fewer constraints than the previous model. Computational experience is presented to compare the two algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ball, M.O./Magnanti, T.L./Monma, C.L./Nemhauser, G.L. (1995): Network routing. (North Holland) Handbooks in Operations Research and Management Science, 8.
Bertossi, A. A./Carraresi, P./Gallo, G. (1987): On some Matching Problems arising in vehicle scheduling models. in: Networks 17, 271–281.
Carpaneto, G./Dell’Amico, M./Fischetti, M./Toth, P. (1989): A branch and bound algorithm for the Multiple Vehicle Scheduling Problem. in: Networks 19, 531 – 548.
Ceder, A./Stern, H. I. (1981): Deficit function bus scheduling with deadheading trip insertions for fleet size reduction. in: Transportation Science 15, 338 – 363.
Dell’Amico, M./Fischetti, M./Toth, P. (1993): Heuristic algorithms for the Multiple Depot Vehicle Scheduling Problem. in: Management Science, Vol. 39, No 1, 115 – 125.
El-Azm (1985): The minimum fleet size problem and its applications to bus scheduling. in: Rousseau, J. M. (ed.): Computer Scheduling of Public Transport 2. (North-Holland) Amsterdam, 493–512.
Forbes, M. A./Holt, J. N./Watts, A. M. (1994): An exact algorithm for Multiple Depot Bus Scheduling. in: European Journal of Operational Research 72, 115 – 124.
Lamatsch, A. (1992): An approach to vehicle scheduling with depot capacity constraints. in: Desrochers, M./Rousseau, J.M. (eds.): Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386. (Springer Verlag) Berlin, Heidelberg, 181–195.
Mesquita, M./Chapter 11(233–255), J. (1992): Multiple Depot Vehicle Scheduling Problem: A new heuristic based on quasi-assignment algorithms. in: Desrochers, M./Rousseau, J.M. (eds): Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386. (Springer Verlag) Berlin, Heidelberg, 167 – 180.
Ribeiro, C./Soumis, F. (1994): A column ceneration cpproach to the Multiple Depot Vehicle Scheduling Problem. in: Operations Research 42, 41–52.
Smith, B/Wren, A. (1981): VAMPIRES and TASC: two successfully applied bus scheduling programs. in: Wren, A. (ed.): Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling. (North-Holland) Amsterdam, 97–124.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mesquita, M., Paixão, J. (1999). Exact Algorithms for the Multi-Depot Vehicle Scheduling Problem Based on Multicommodity Network Flow Type Formulations. In: Wilson, N.H.M. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85970-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-85970-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65775-0
Online ISBN: 978-3-642-85970-0
eBook Packages: Springer Book Archive