An Algorithm for Finding Reasonable Paths in Transit Networks

This paper aims to define reasonable paths in transit networks as possible paths that satisfy the acceptable time criterion and transfer-walk criterion. A recursive algorithm for finding all reasonable paths in a transit network that do not involve a rapid increase in program run-time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. Results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decisionmaking has been confirmed by the positive feedback that was obtained from survey questionnaires.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/5121625
• Authors:
  • Tan, Man-chun
  • Tong, C O
  • Wong, S C
  • Xu, Jianmin
• Publication Date: 2007

Language

• English

Media Info

• Media Type: Print
• Features: Figures; References; Tables;
• Pagination: pp 285-305
• Serial:
  • Journal of Advanced Transportation
  • Volume: 41
  • Issue Number: 3
  • 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: Algorithms; Bus transit operations; Decision support systems; Heuristic methods; Optimization; Public transit; Shortest path algorithms
• Uncontrolled Terms: Transit trip planning
• Subject Areas: Administration and Management; Operations and Traffic Management; Public Transportation;

Filing Info

• Accession Number: 01076359
• Record Type: Publication
• Files: TRIS
• Created Date: Sep 21 2007 1:53PM