Skip to main content
SpringerLink
Log in

Scheduling Considerations in Designing Transit Routes at the Network Level

  • Conference paper
Computer-Aided Transit Scheduling

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 386))

Abstract

TROPT (Transit Routes OPTimization) is a system of software tools used to create, analyze and optimize bus route networks. The system generates all feasible routes and transfers which connect every place (node) in the network to all others. From this vast pool of possible routes and transfers it then generates smaller subsets which maintain network connectivity. For each subset thus generated the system meets transportation demands by calculating the appropriate frequency for each route. Based on the specific optimization parameter desired by the user, it is possible to select the most suitable subset. TROPT has been designed as a tool for the planning of future transit networks as well as the maintenance of existing ones. It allows the user to either input his own data or to run the system automatically.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ceder, A. (1984). Bus frequency determination using passenger count data. Trans. Res., Vol. 18A, No. 516.

    Google Scholar 

  • Ceder, A. (1986). Methods for creating bus timetables. Trans. Res., Vol. 21A, No. 1, pp. 59–83.

    Google Scholar 

  • Ceder, A. and H. Stern (1981). Deficit function bus scheduling with deadheading trip insertion for fleet size reduction. Trans. Res. Record, Vol. 15, No.4.

    Google Scholar 

  • Ceder, A. and H. Stern (1982). A graphical person-machine interactive approach for bus scheduling. Trans. Res. Record, Vol. 857.

    Google Scholar 

  • Ceder, A. and N. Wilson (1986). Bus Network Design. Trans. Res. B., Vol. 208, No. 4, pp. 331–334.

    Article  Google Scholar 

  • Cohon, J.L. (1978). Multiobjective Programming and Planning, Academic Press, New York.

    Google Scholar 

  • Dial, R.B. and R.E. Bunyan (1968). Public transit planning system. Socio-Economic Plan. Science, Vol. 1. pp. 345–362, 1968.

    Article  Google Scholar 

  • Dubois, D., G. Bel and M. Libre (1979). A set of methods in transportation network synthesis and analysis. Operations Research, Vol. 30, No. 9. pp. 797–808.

    Google Scholar 

  • Duckstein, L. and S. Opricovic (1980). Multiobjective optimization in river basin development. Water Resources Research, Vol. 16(1), pp. 14–20.

    Article  Google Scholar 

  • Goicoechea, A., D.R. Hansen and L. Duckstein (1982). Multiobjective Decision Analysis with Engineering and Business Applications. John Wiley & Sons, N.Y.

    Google Scholar 

  • Hasselstrom, D. (198l). Public Transportation Planning. Ph.D. thesis, Department of Business Administration, Univ. of Gothenburg, Sweden.

    Google Scholar 

  • Heathington, K.W., J. Miller, R.R. Knox, G.C. Hoff and J. Bruggman (1968). Computer simulation of a demand scheduled bus system offering door to door service. Highway Res. Record, Vol. 91. 251, pp. 26–40.

    Google Scholar 

  • Israeli, Y. (1990). Optimal Routing Allocation to Transfer Demand in Networks. Doctoral dissertation, Civil Engineering Department, Technion — Israel Institute of Technology, Israel.

    Google Scholar 

  • Israeli, Y. and A. Ceder (1989). Designing transit routes at the network level. Proceedings of the IEEE First Vehicle Navigation and Information Systems Conference (VNIS’89), IEEE Cat. No. 89CH2789–6, by Peekie D.H.M, E.R. Case and J. Tsai (eds.), Toronto, Ontario, Canda, pp. 310–316, Sept.

    Google Scholar 

  • Keudel, W. (1988). Computer-aided line network design (DIANA) and minimization of transfer times in networks (FABIAN). In Proceedings of the International Workshop on Computer-Aided Transit Scheduling, in J. R. Daduna and A. Wren (eds.), Lecture notes in economics and mathematical sciences., No. 308, Springer-Verlag Pub. Co.

    Google Scholar 

  • Kocur, G. and C. Hendrickson (1982). Design of local bus service with demand equilibration. Trans. Science, Vol. l6, No. 2, pp. 149–170.

    Article  Google Scholar 

  • Kuan, G.K. and J. Perl (1988). Optimization of feeder bus routes and bus-stop spacing. Journal of Trans. Eng., Vol. 114, No. 3. May.

    Google Scholar 

  • Lampkin, W. and P.D. Saalmans (1967). The design of routes, service frequencies and schedules for a municipal bus undertaking: a case study. Operations Research, Vol. 18, No.4, pp. 375–397.

    Article  Google Scholar 

  • Magnanti, T.L. and R.L. Wong (1984). Network design and transportation planning: models and algorithms. Trans. Science, Vol. 18, No. 1, pp. 1–55. Feb.

    Article  Google Scholar 

  • Mandl, C.E. (1979). Evaluation and optimization of urban public transportation networks. European Journal of Operational Research, Vol. 5. pp. 396–404.

    Article  Google Scholar 

  • Marguier, P.H.J, and A. Ceder (1984). Passenger waiting strategies for overlapping bus routes. Trans. Science, Vol. l8, No.3, PP. 207–230.

    Article  Google Scholar 

  • Marwah, B.R., F.S. Umrigar and S.B. Patnaik (1984). Optimal design of bus routes and frequencies for Ahmedabad. Trans. Res. Record, Vol. 994, pp. 41–47.

    Google Scholar 

  • Minieka, E. (1978). Optimization Algorithms for Networks and Graphs. New York: Marcel Dekker Inc., ch.5, pp. 181–234.

    Google Scholar 

  • Rapp, M., C. Gehmer and H. Spiess (1976), NOPTS — Computer Program for Operational Planning in Public Transit, Lausanne, Switzerland: ITEP, Feb. 1976.

    Google Scholar 

  • Rea, T.C. (1971). Designing Urban Transit Systems: An Approach to the Route Technology Selection Problem. Seattle, Washington: PB 204 88l, Univ. of Washington.

    Google Scholar 

  • Sharp, G.P. (1974). Public transit system network models: Consideration of guideway construction, passenger travel, delay time and vehicle scheduling. Georgia Institute of Technology, Ph.D. Thesis, Atlanta, Georgia, U.S.A.

    Google Scholar 

  • Silman, L.A., Z. Barzily and U. Passy (1974). Planning the route system for urban buses. Computers and Opns. Res., Vol. 1, pp. 201–211.

    Article  Google Scholar 

  • Stern, H. and A. Ceder (1983). An improved lower bound to the minimum fleet size problem. Trans. Science, Vol. 17, No. 4, pp. 471–483.

    Article  Google Scholar 

  • Syslo, M.M., N. Deo and J.S. Kowalit (1983). Discrete Optimization Algorithms., New Jersey: Prentice Hall Inc., ch. 2, pp. 176–211.

    Google Scholar 

  • Tsao, S. and P. Schonfeld (1984). Branched transit services: an analysis. Journal of Trans. eng., Vol. 110, No. 1, pp. 112–128, January 1984.

    Article  Google Scholar 

  • Vandebona, U. and A.J. Richardson (1985). Simulation of trasit route operations. Trans. Res. Record, Vol. 1036, pp. 36–40.

    Google Scholar 

  • Zeleny, M. (1973). Compromise programming. In Cochrane J.L. and M. Zeleny (eds.) Multiple Criteria Decision Making, Columbia: Univ. of South Carolina Press.

    Google Scholar 

  • Zeleny, M. (1974a; 1974b). A concept of compromise solutions and the method of the displaced ideal. Computers and operations Research, Vol. 1(4), pp. 479–496;

    Article  Google Scholar 

  • Zeleny, M. (1974a; 1974b). Linear Multiobjective Programming, New York: Springer-Verlag.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Civil Engineering Department, Transportation Research Institute, Technion, Haifa, Israel

    Avishai Ceder & Yechezkel Israeli

Authors
  1. Avishai Ceder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yechezkel Israeli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. École Polytechnique, C. P. 6079, Succursale A, Montréal, Canada, H3C 3A7

    Martin Desrochers

  2. Département d’informatique et de recherche opérationnelle, Université de Montréal, C. P. 6128, Succursale A, Montréal, Canada, H3C 3J7

    Jean-Marc Rousseau

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ceder, A., Israeli, Y. (1992). Scheduling Considerations in Designing Transit Routes at the Network Level. In: Desrochers, M., Rousseau, JM. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85968-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85968-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55634-3

  • Online ISBN: 978-3-642-85968-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation