Abstract
Most large transit companies operate several garages, and must face the problem of deciding which garages will adequately serve bus routes. Several costs and operational constraints must be taken into account in the decision process. Since terminology varies between transit operators, we first define some basic terms.
The objective of the system described is to assign vehicle trips independently or by lines to the various garages of a transit company in order to minimize both the number of vehicles required and the deadhead costs. The system can also be used to study the optimal location of new garages. A heuristic procedure is proposed for solving this problem because of the variety of operational constraints which must be respected These constraints include the requirement for trips of a subset of routes to be assigned to a specific garage, to only one garage among a given subset, or to be split amongst no more than two or three garages. Constraints on the minimum and maximum number of buses assigned to a garage for peak and off-peak services are also imposed. The problem and solution methods are discussed in the context of the S. T. C. U.M., (the Montreal Transit Commission) where the system will be implemented.
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
Bodin, L.; Golden, B.; Assad, A.; Ball, M.: Routing and Scheduling of Vehicles and Crews: The State-of-The-Art. Computers and Operations Research 10 (1983), 63–211
Carraresi, P.; Gallo, G.: Network Models for Vehicle and Crew Scheduling. European Journal of Operations Research 16 (1984), 139–151
Désuets, M.; Lessard, R.: Description de l’algorithme d’affectation des lignes d’autobus aux garages. Publication #391, Centre de recherche sur les transports, Université de Montréal 1984
Desrosiers, J., Soumis, F., Desrochers, M.: Routes sur un réseau espace-temps. Publication #236, Centre de recherche sur les transports, Université de Montréal 1982
Mandl, C.: Evaluation and Optimization of Urban Public Transportation Networks. European Journal of Operations Research 5 (1980), 396–404
Maze, T.H.; Rhasnabis, S.: Bus Garage Location Planning with Dynamic Vehicle Assignements: A Methodology. Transportation Research 19B (1985), 1–13
Rousseau, J.-M.: Schedule Planning for Transit Operations. Publication #481, Centre de recherche sur les transports, Université de Montréal 1986
Scott, D.: Minimal Fleet Size in Transshipment-Type Vehicle Scheduling Problems. Publication #487, Centre de recherche sur les ransports, Université de Montréal To appear in Transportation Science (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rousseau, JM., Lessard, R., Désilets, M. (1988). ALIAGES: A System for the Assignment of Bus Routes to Garages. In: Daduna, J.R., Wren, A. (eds) Computer-Aided Transit Scheduling. Lecture Note in Economics Mathematical Systems, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85966-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-85966-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19441-5
Online ISBN: 978-3-642-85966-3
eBook Packages: Springer Book Archive