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:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/5121625
-
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
- Features: References;
- Pagination: p. 145-161
-
Serial:
- Journal of Advanced Transportation
- Volume: 18
- Issue Number: 2
- Publisher: John Wiley & Sons, Incorporated
- ISSN: 0197-6729
- EISSN: 2042-3195
- Serial URL: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2042-3195
-
Publication flags:
Open Access (libre)
Subject/Index Terms
- TRT Terms: Accessibility; Analysis; Information processing; Network analysis (Planning); Passenger information systems; Public transit; Rapid transit; Routes; Scheduling
- Uncontrolled Terms: Computer aided analysis
- Old TRIS Terms: Route analysis
- Subject Areas: Data and Information Technology; Public Transportation;
Filing Info
- Accession Number: 00393534
- Record Type: Publication
- Source Agency: Engineering Index
- Files: TRIS
- Created Date: May 31 1985 12:00AM