An algorithm for finding reasonable paths in transit networks

被引：0
|
作者：
Tan, Man-Chun [1 ]
Tong, C.O. [2 ]
Wong, S.C. [2 ]
Xu, Jian-Min [3 ]
机构：
[1] College of Information Science and Technology, Jinan University, Guangzhou, China
[2] Department of Civil Engineering, University of Hong Kong, Hong Kong, Hong Kong
[3] College of Traffic and Communication, South China University of Technology, Guangzhou, China
来源：
Journal of Advanced Transportation | 1600年 / 41卷 / 03期
关键词：
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;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Journal article (JA)
引用
收藏
页码：285 / 305
相关论文
共 50 条
  • [41] Multiple QoS Constraints Finding Paths Algorithm in TMN
    Li Qianmu
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2011, 14 (03): : 731 - 737
  • [42] A New Algorithm for Finding Vertex-Disjoint Paths
    Kurt, Mehmet
    Berberler, Murat
    Ugurlu, Onur
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2015, 12 (06) : 550 - 555
  • [43] Improved algorithm for finding next-to-shortest paths
    Li, Shisheng
    Sun, Guangzhong
    Chen, Guoliang
    INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 192 - 194
  • [44] An improved algorithm for finding all minimal paths in a network
    Bai, Guanghan
    Tian, Zhigang
    Zuo, Ming J.
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2016, 150 : 1 - 10
  • [45] The new algorithm for finding the paths based on coding graph
    Dept. of Software Engineering, Shenzhen Polytechnic, Shenzhen, China
    Wang, M. (wmingfu@21cn.com), 1600, Academy Publisher (07):
  • [46] A new algorithm for finding the shortest paths using PCNNs
    Qu, Hong
    Yi, Zhang
    CHAOS SOLITONS & FRACTALS, 2007, 33 (04) : 1220 - 1229
  • [47] An approximation algorithm for finding long paths in Hamiltonian graphs
    Vishwanathan, S
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 50 (02): : 246 - 256
  • [48] AN ALGORITHM FOR FINDING HAMILTON PATHS AND CYCLES IN RANDOM GRAPHS
    BOLLOBAS, B
    FENNER, TI
    FRIEZE, AM
    COMBINATORICA, 1987, 7 (04) : 327 - 341
  • [49] AN ALGORITHM FOR FINDING THE K-QUICKEST PATHS IN A NETWORK
    CHEN, YL
    COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (01) : 59 - 65
  • [50] Finding Least Cost Hyperpaths in Multimodal Transit Networks Methodology, Algorithm, and Large-Scale Application
    Verbas, I. Oemer
    Mahmassani, Hani S.
    TRANSPORTATION RESEARCH RECORD, 2015, (2497) : 95 - 105
12345