Optimization of modern tram network based on k-shortest path algorithm

被引：0
|
作者：
Hu, Junhong [1 ,2 ]
Guo, Xiucheng [1 ]
Tao, Tao [1 ]
Hu, Tingting [1 ]
机构：
[1] School of Transportation, Southeast University, Nanjing,210096, China
[2] College of Transportation Science and Technology, Nanjing Technology University, Nanjing,210009, China
来源：
Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) | 2017年 / 47卷 / 06期
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory
引用
收藏
页码：1274 / 1278
相关论文
共 50 条
  • [11] COMPUTATIONAL EXPERIENCE WITH AN ALGORITHM FOR FINDING K-SHORTEST PATHS IN A NETWORK
    SHIER, DR
    JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1974, B 78 (03): : 139 - 165
  • [12] Security access control method of heterogeneous database based on K-shortest path algorithm
    Zhou W.
    Yao M.
    International Journal of Reasoning-based Intelligent Systems, 2024, 16 (02) : 170 - 177
  • [13] Assessing the effectiveness of k-shortest path sets in problems of network interdiction
    Yates, Justin
    Wang, Xinghua
    Chen, Nannan
    OPTIMIZATION AND ENGINEERING, 2014, 15 (03) : 721 - 749
  • [14] Optimal uncertainty reduction search using the k-shortest path algorithm
    Sujit, PB
    Ghose, D
    PROCEEDINGS OF THE 2003 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2003, : 3269 - 3274
  • [15] Assessing the effectiveness of k-shortest path sets in problems of network interdiction
    Justin Yates
    Xinghua Wang
    Nannan Chen
    Optimization and Engineering, 2014, 15 : 721 - 749
  • [16] Research on K-shortest path algorithm in train operation in emergency events based on ant colony algorithm
    Chen F.
    Zhang Q.
    Wang T.
    Zhao H.T.
    Advances in Transportation Studies, 2017, 2 (Special Issue): : 21 - 30
  • [17] A simplification of the double-sweep algorithm to solve the k-shortest path problem
    Rink, KA
    Rodin, EY
    Sundarapandian, V
    APPLIED MATHEMATICS LETTERS, 2000, 13 (08) : 77 - 85
  • [18] Solving the k-shortest path problem with time windows in a time varying network
    Androutsopoulos, Konstantinos N.
    Zografos, Konstantinos G.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (06) : 692 - 695
  • [19] Study on the K-shortest Paths Searching Algorithm of Urban Mass Transit Network Based on the Network Characteristics
    Zhou, Weiteng
    Han, Baoming
    Yin, Haodong
    ADVANCES IN TRANSPORTATION, PTS 1 AND 2, 2014, 505-506 : 689 - 697
  • [20] COMPUTING K-SHORTEST PATH LENGTHS IN EUCLIDEAN NETWORKS
    SKISCIM, CC
    GOLDEN, BL
    NETWORKS, 1987, 17 (03) : 341 - 352
12345