Urban Transit Scheduling: Framework, Review and Examples
Publication: Journal of Urban Planning and Development
Volume 128, Issue 4
Abstract
A transit operational planning process includes four basic components performed usually in sequence: (1) network route design; (2) setting timetables; (3) scheduling vehicles to trips; and (4) assignment of drivers. This planning process is extremely cumbersome and complex and often creates confusion in its interrelationships among researchers and practitioners. The purpose of this work is to construct a framework and to provide an overview and examples of certain practical methodologies aimed at solving the transit scheduling problems. In the past 20 years, a considerable amount of effort has been invested in the computerization of the four components mentioned above. This is in order to provide more efficient, controllable, and responsive schedules. Nonetheless, despite the software used, no system is yet able to solve large scheduling problems, and manual intervention is necessary. There is a need to bridge the gap between the software system designers and the transit schedulers via the identification and organization of all the elements involved, including the current availability of data. This work emphasizes certain data needs along with examples for crystallizing and clarifying the transit scheduling undertaking. It is suggested that most of the scheduling tasks can be performed automatically, but it is preferable to undertake some of them through a conversational man-computer mode.
Get full access to this article
View all available purchase options and get full access to this article.
References
Bianco, L., Bielli, M., Mingozzi, A., Riccardelli, S., and Spadoni, M.(1992). “A heuristic procedure for the crew rostering problem.” Eur. J. Oper. Res., 58, 272–283.
Bondin, L., Golden, B., Assad, A., and Ball, M.(1983). “Routing and scheduling of vehicles and crews: The state of art.” Computers and Operation Research, 10, 63–211.
Caprara, A., Fischetti, M., Guida, P. L., Toth, P., and Vigo, D. (1999). “Solution of large scale railway crew planning problems: The Italian experience.” Computer-aided scheduling of public transport, N. H. M. Wilson, ed., Springer, New York, 1–18.
Carraresi, P., and Gallo, G.(1984). “A multilevel bottleneck assignment approach to the bus drivers’ rostering problem.” Eur. J. Oper. Res., 16, 163–173.
Ceder, A.(1984). “Bus frequency determination using passenger count data.” Transp. Res., 18A(5/6), 439–453.
Ceder, A.(1986). “Methods for creating bus timetables.” Transp. Res., 21A(1), 59–83.
Ceder, A. (1990). “Optimal design of transit short-turn trips.” Transportation Research Record 1221, Transportation Research Board, Washington, D.C., 8–22.
Ceder, A.(1991). “A procedure to adjust transit trip departure times through minimizing the maximum headways.” Computers and Operations Research, 18(5), 417–431.
Ceder, A. (2002). “A step function for improving transit operations planning using fixed and variable scheduling.” Transportation & Traffic Theory (15th ISTTT), M.A.P. Taylor, ed., Elsevier Science and Pergamon Publishing, 1–21.
Ceder, A., and Stern, H. I.(1981). “Deficit function bus scheduling with deadheading trip insertion for fleet size reduction.” Transp. Sci., 15(4), 338–363.
Ceder, A., and Stern, H. I. (1982). “Graphical person-machine interactive approach for bus scheduling.” Transportation Research Record 857, Transportation Research Board, Washington, D.C., 69–72.
Ceder, A., and Stern, H. I. (1984). “Optimal transit timetables for a fixed vehicle fleet.” Proc., 10th Int. Symp. on Transportation and Traffic Theory, Volmuller, J., and R. Hammerslag, Eds., UNU Science, Holland, 331–355.
Ceder, A., and Tal, O. (1999). “Timetable synchronization for buses.” Computer-aided scheduling of public transport, N. H. M. Wilson, ed., Springer, New York, 245–258.
Daduna, J. R., Branco, I., and Paixao, J. M. P., eds. (1995). “Computer-aided transit scheduling.” Lecture notes in economics and mathematical systems 410, Springer, New York.
Daduna, J. R., and Paixao, J. M. P. (1995). “Vehicle scheduling for public mass transit- and overview.” Computer-aided transit scheduling, J. R. Daduna et al., eds., Springer, New York.
Daduna, J. R., and Wren, A., eds. (1988). “Computer-aided transit scheduling.” Lecture notes in economics and mathematical systems 308, Springer, New York.
Desrochers, M., and Rousseau, J. M., eds. (1992). “Computer-aided transit scheduling.” Lecture notes in economics and mathematical systems 386, Springer, New York.
Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F. (1995). “Time constrained routing and scheduling.” Network routing volume 8 of handbooks in operations research and management science, M. O. Ball et al., eds., Elsevier Science, New York, 35–39.
Freling, R., Wagelman, A. P. M., and Paixao, J. M. P. (1999). “An overview of models and techniques of integrating vehicle and crew scheduling.” Computer-aided scheduling of public transport, N. H. M. Wilson, ed., Springer, New York, 441–460.
Furth, P. G., and Wilson, N. H. M. (1981). “Setting frequencies on bus routes: Theory and practice.” Transportation Research Record 818, Transportation Research Board, Washington, D.C., 1–7.
Gavish, B., Schweitzer, P., and Shlifer, E.(1978). “Assigning buses to schedules in a metropolitan area.” Computers and Operations Research, 5, 129–138.
Gertsbach, I., and Gurevich, Y.(1977). “Constructing an optimal fleet for transportation schedule.” Transp. Sci., 11, 20–36.
Koutsopoulos, H. N., Odoni, A., and Wilson, N. H. M. (1985). “Determination of headways as function of time varying characteristics on a transit network.” Computer scheduling of public transport 2, J. M. Rousseau, ed., North-Holland, Amsterdam, 391–414.
Löbel, A. (1999). “Solving large scale multiple-depot vehicle scheduling problems.” Computer-aided scheduling of public transport, N. H. M. Wilson, ed., Springer, New York, 192–220.
Mesquita, M., and Paixao, J. M. P. (1999). “Exact algorithms for the multi-depot vehicle scheduling problem based on multicommodity network flow type formulations.” Computer-aided scheduling of public transport, N. H. M. Wilson, ed., Springer, New York, 221–243.
Rousseau, J. M., ed. (1985). Computer scheduling of public transport 2, North-Holland, Amsterdam.
Stern, H. I., and Ceder, A.(1983). “An improved lower bound to the minimum fleet size problem.” Transp. Sci., 17(4), 471–477.
Voss, S., and Daduna, J. R. (2001). “Computer scheduling of public transport.” Lecture notes in economics and mathematical systems 505, Springer, New York.
Wilson, N. H. M., ed. (1999). “Computer-aided scheduling of public transport.” Lecture notes in economics and mathematical systems 471, Springer, New York.
Wren, A., ed. (1981). Computer scheduling of public transport 2: Urban passenger vehicle and crew scheduling, North-Holland, Amsterdam.
Information & Authors
Information
Published In
Journal of Urban Planning and Development
Volume 128 • Issue 4 • December 2002
Pages: 225 - 244
Copyright
Copyright © 2002 American Society of Civil Engineers.
History
Received: Feb 27, 2002
Accepted: Jun 4, 2002
Published online: Nov 15, 2002
Published in print: Dec 2002
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.