A PARALLEL TIME-DEPENDENT MULTIMODAL SHORTEST PATH ALGORITHM BASED ON GEOGRAPHICAL PARTITIONING

被引：0
|
作者：
Ayed, H.
Habbas, Z.
Khadraoui, D.
机构：
来源：
PROCEEDINGS OF THE 2011 3RD INTERNATIONAL CONFERENCE ON SOFTWARE TECHNOLOGY AND ENGINEERING (ICSTE 2011) | 2011年
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
This paper deals with the Time Dependent Multimodal Transport Problem (TDMTP). Mainly, it proposes a parallel algorithm for solving the TDMTP in very large networks. We implemented our algorithm on a parallel shared memory machine, being tested in a super computer cluster. The first experiments on random theoretical graphs as well as on real networks are very promising.
引用
收藏
页码：411 / 415
页数：5
相关论文
共 50 条
  • [21] A Variable Time-Discretization Strategies-Based, Time-Dependent Shortest Path Algorithm for Dynamic Traffic Assignment
    Tian, Ye
    Chiu, Yi-Chang
    JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2014, 18 (04) : 339 - 351
  • [22] 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
  • [23] Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting
    He, Edward
    Boland, Natashia
    Nemhauser, George
    Savelsbergh, Martin
    INFORMS JOURNAL ON COMPUTING, 2021, 33 (03) : 997 - 1014
  • [24] α-Reliable Shortest Path Problem in Uncertain Time-Dependent Networks
    Biswal S.
    Ghorai G.
    Mohanty S.P.
    International Journal of Applied and Computational Mathematics, 2022, 8 (4)
  • [25] A minmax regret version of the time-dependent shortest path problem
    Conde, Eduardo
    Leal, Marina
    Puerto, Justo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (03) : 968 - 981
  • [26] Finding Reliable Shortest Path In Stochastic Time-Dependent Network
    Pan, Yiyong
    Sun, Lu
    Ge, Minli
    INTELLIGENT AND INTEGRATED SUSTAINABLE MULTIMODAL TRANSPORTATION SYSTEMS PROCEEDINGS FROM THE 13TH COTA INTERNATIONAL CONFERENCE OF TRANSPORTATION PROFESSIONALS (CICTP2013), 2013, 96 : 451 - 460
  • [27] The dynamic shortest path problem with time-dependent stochastic disruptions
    Sever, Derya
    Zhao, Lei
    Dellaert, Nico
    Demir, Emrah
    Van Woensel, Tom
    De Kok, Ton
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2018, 92 : 42 - 57
  • [28] Constrained Shortest Path Query in a Large Time-Dependent Graph
    Yuan, Ye
    Lian, Xiang
    Wang, Guoren
    Ma, Yuliang
    Wang, Yishu
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (10): : 1058 - 1070
  • [29] Distributed shortest-path protocols for time-dependent networks
    Orda, A
    Rom, R
    DISTRIBUTED COMPUTING, 1996, 10 (01) : 49 - 62
  • [30] Reliable Shortest Path Problems in Stochastic Time-Dependent Networks
    Chen, Bi Yu
    Lam, William H. K.
    Sumalee, Agachai
    Li, Qingquan
    Tam, Mei Lam
    JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2014, 18 (02) : 177 - 189
12345