We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
An algorithm for finding reasonable paths in transit networks.
- Authors
Tan, Man-chun; Tong, C. O.; Wong, S. C.; Xu, Jian-min
- Abstract
In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer-walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does 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. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision-making has been confirmed by the positive feedback that was obtained from survey questionnaires.
- Subjects
HONG Kong (China); GUANGZHOU (China); CHINA; LOCAL transit access; CRITERION (Theory of knowledge); ALGORITHMS; TRANSPORTATION planning; DECISION making
- Publication
Journal of Advanced Transportation, 2007, Vol 41, Issue 3, p285
- ISSN
0197-6729
- Publication type
Article
- DOI
10.1002/atr.5670410305