COMPUTER MODEL FOR FINDING THE TIME-DEPENDENT MINIMUM PATH IN A TRANSIT SYSTEM WITH FIXED SCHEDULES

This paper describes the development of a computer model and algorithms for finding the time-dependent minimum path between two stations in a multi-route, multi-mode transit system running to fixed schedules. Selection of the minimum path can be based either on journey time or on weighted time. A worked example using a simple transit network is given to illustrate how the model works. The model has several applications in transport planning: it can be used for generating route schedule information to guide transit users, for assisting in route schedule coordination, and for analyzing transit system accessibility.

  • Availability:
  • Corporate Authors:

    Institute for Transportation, Incorporated

    1410 Duke University Road
    Durham, NC  United States  27705
  • Authors:
    • Tong, C O
    • Richardson, A J
  • Publication Date: 1984

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00393534
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: May 31 1985 12:00AM