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 条
  • [1] An algorithm for finding reasonable paths in transit networks
    Tan, Man-chun
    Tong, C. O.
    Wong, S. C.
    Xu, Jian-min
    JOURNAL OF ADVANCED TRANSPORTATION, 2007, 41 (03) : 285 - 305
  • [2] Finding shortest time-dependent paths in schedule-based transit networks: A label setting algorithm
    Florian, M
    SCHEDULE-BASED DYNAMIC TRANSIT MODELING: THEORY AND APPLICATIONS, 2004, 28 : 43 - 52
  • [3] Incremental algorithm for finding disjoint paths in sensor networks
    Zhang, Ke-Jia
    Gao, Hong
    Tongxin Xuebao/Journal on Communications, 2010, 31 (9 A): : 59 - 67
  • [4] DERIVATION OF A DISTRIBUTED ALGORITHM FOR FINDING PATHS IN DIRECTED NETWORKS
    MCCURLEY, R
    SCHNEIDER, FB
    SCIENCE OF COMPUTER PROGRAMMING, 1986, 6 (01) : 1 - 9
  • [5] Efficient Algorithm for Finding Multi-Paths in Telecommunication Networks
    Zhang, Jinxin
    Liang, Mangui
    Wang, Zhaowei
    ADVANCED MATERIALS AND COMPUTER SCIENCE, PTS 1-3, 2011, 474-476 : 2274 - +
  • [6] A localized algorithm for finding disjoint paths in wireless sensor networks
    Hou, Ronghui
    Shi, Haoshan
    IEEE COMMUNICATIONS LETTERS, 2006, 10 (12) : 807 - 809
  • [7] EFFECTIVE ALGORITHM FOR FINDING SHORTEST PATHS IN DENSE GAUSSIAN NETWORKS
    Monakhova, E. A.
    Monakhov, O. G.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2022, (58): : 94 - 104
  • [8] Algorithm for Finding Optimal Paths in a Public Transit Network with Real-Time Data
    Jariyasunant, Jerald
    Mai, Eric
    Sengupta, Raja
    TRANSPORTATION RESEARCH RECORD, 2011, (2256) : 34 - 42
  • [9] A MODIFIED GENETIC ALGORITHM FOR FINDING FUZZY SHORTEST PATHS IN UNCERTAIN NETWORKS
    Heidari, A. A.
    Delavar, M. R.
    XXIII ISPRS CONGRESS, COMMISSION II, 2016, 41 (B2): : 299 - 304
  • [10] A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
    Hadid, Rachid
    Karaata, Mehmet Hakan
    Villain, Vincent
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (04) : 411 - 435
12345