An algorithm for finding reasonable paths in transit networks |
| |
| Authors: | Man‐chun Tan C. O. Tong S. C. Wong Jian‐min Xu |
| |
| Affiliation: | 1. Man‐chun Tan, College of Information Science and Technology, Jinan University, Guangzhou, China;2. C.O. Tong and S.C. Wong, Department of Civil Engineering, The University of Hong Kong, Hong Kong, China;3. Jian‐min Xu, College of Traffic and Communication, South China University of Technology, Guangzhou, China |
| |
| 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. |
| |
| Keywords: | transit network trip planning path‐finding algorithm reasonable path |
|
|
