Abstract
These results show that urban transit routing problems with flexible schedules can be solved optimally. Problems with wider time intervals could be solved, and the network aggregation used allows systems of up to 500 trips to be handled without memory problems.
Savings of the order of 5% in vehicle numbers, and of 1–3% in travel and waiting times could represent appreciable economies on a large network. The savings in travel and waiting times are much higher with our exact method than with the heuristic method. The comparison is made on only one example but this would seem to be generally indicative as the example given was selected by the authors of the heuristic method.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
11. References
Bellmore, Malone: Pathology of travelling salesman subtour elimination algorithm. Operations Research 19 (1971) 278–307.
Bodin, Golden, Assad, Ball: Routing and Scheduling of Vehicles and Crews: The State of the Art. Computer and Operations Research 10 (1983), 69–211.
Bokinge, Hasselstrom: Improved Vehicle Scheduling in Public Transport Throught Systematic Changes in the Time Table. EJOR 5 (1980) 388–395.
Carpaneto, Toth: Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science 26 (1980), 736–743.
Desrosiers, Pelletier, Soumis: Plus court chemin avec contraintes d'horaires. RAIRO, Rech. Opér. 17 (1983), 1–21.
Desrosiers, Soumis, Desrochers: Routing with Time Windows by Column Generation. Ecole des Hautes Etudes Commerciales de Montréal, no G83-15, presented at EURO VI, Vienna (1983).
Desrosiers, Soumis: Routes sur un réseau espace-temps. Administrative Sciences Association of Canada, Man. Sci./Rech.op., vol. 3 no 2 (1982), 24–32.
Desrosiers, Soumis, Desrochers, Sauvé: Routing and Scheduling with Time Windows Solved by Network Relaxation and Branch-and-bound on Time Variables. To appear in Computer Scheduling of Public Transport, vol. II, North Holland, J.-M. Rousseau Ed.
Grigoriadis, Tau Hsu: RNET — The Rutgers Minimum Cost Network Flow Subroutines. Rutgers University, New Jersey, 1979.
Levin: Scheduling and fleet routing models for transportation systems, Transportation Science 5, 232–255.
Swersey, Ballard: Scheduling School Buses. Published at Yale School of Organization and Management and presented at TIMS/ORSA Conference, San Diego (1982).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Soumis, F., Desrosiers, J., Desrochers, M. (1984). Optimal urban bus routing with scheduling flexibilities. In: Thoft-Christensen, P. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008887
Download citation
DOI: https://doi.org/10.1007/BFb0008887
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13185-4
Online ISBN: 978-3-540-38828-9
eBook Packages: Springer Book Archive