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 条
  • [31] Finding Alternative Shortest Paths in Spatial Networks
    Xie, Kexin
    Deng, Ke
    Shang, Shuo
    Zhou, Xiaofang
    Zheng, Kai
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2012, 37 (04):
  • [32] Finding the K shortest paths in a schedule-based transit network
    Xu, Wangtu
    He, Shiwei
    Song, Rui
    Chaudhry, Sohail S.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (08) : 1812 - 1826
  • [33] OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
    Kejia Zhang
    Qilong Han
    Guisheng Yin
    Haiwei Pan
    Journal of Combinatorial Optimization, 2016, 31 : 1623 - 1641
  • [34] A parallel algorithm for finding K expected shortest paths in stochastic and time-dependent networks
    Tan, GZ
    Yu, Y
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMPUTER SCIENCE II, 2002, : 362 - 367
  • [35] OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
    Zhang, Kejia
    Han, Qilong
    Yin, Guisheng
    Pan, Haiwei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1623 - 1641
  • [36] A Parallel Algorithm for Finding the Shortest Exit Paths in Mines
    Jastrzab, Tomasz
    Buchcik, Agata
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2017 (ICCMSE-2017), 2017, 1906
  • [37] An Effective Algorithm for Finding Shortest Paths in Tubular Spaces
    Dang-Viet-Anh Nguyen
    Szewczyk, Jerome
    Rabenorosoa, Kanty
    ALGORITHMS, 2022, 15 (03)
  • [38] A DUAL SIMPLEX ALGORITHM FOR FINDING ALL SHORTEST PATHS
    FLORIAN, M
    NGUYEN, S
    PALLOTTINO, S
    NETWORKS, 1981, 11 (04) : 367 - 378
  • [39] A genetic algorithm for finding the k shortest paths in a network
    Hamed, Ahmed Younes
    EGYPTIAN INFORMATICS JOURNAL, 2010, 11 (02) : 75 - 79
  • [40] Finding Short Paths on Polytopes by the Shadow Vertex Algorithm
    Brunsch, Tobias
    Roeglin, Heiko
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 279 - 290
12345