Design and implementation of parallel time-dependent least time path algorithms for intelligent transportation systems applications

被引:32
作者
Ziliaskopoulos, A
Kotzinos, D
Mahmassani, HS
机构
[1] FDN RES & TECHNOL HELLAS,INST COMP SCI,IRAKLION,GREECE
[2] UNIV TEXAS,DEPT CIVIL ENGN,AUSTIN,TX 78712
关键词
D O I
10.1016/S0968-090X(97)00004-1
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
The development of Intelligent Transportation Systems (ITS) and the resulting need for real-time traffic management and route guidance models require fast shortest-path algorithms that can account for the dynamics of traffic networks. The objective of this paper is to introduce parallel designs for time-dependent shortest-path algorithms that can be used in real-time ITS applications. In this paper, two shared-memory and one message-passing algorithms are designed, implemented, coded and computationally tested on actual and random networks. The reported tests are performed on GRAY supercomputers, but the algorithms can be readily ported to lower-end multiprocessor machines. (C) 1997 Elsevier Science Ltd.
引用
收藏
页码:95 / 107
页数:13
相关论文
共 20 条
  • [1] Bellman R.E., 1958, Quarterly of applied mathematics, V16, P87, DOI [10.1090/qam/102435, DOI 10.1090/QAM/102435]
  • [2] Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
  • [3] COOKE KL, 1966, J MATH ANAL APPL, V14, P492
  • [4] *CRAY RES INC, 1991, PAR PROC GUID, V4
  • [5] *CRAY RES INC, 1994, PVM HENCE PROGR MAN
  • [6] *CRAY RES INC, 1993, MPP SOFTW GUID
  • [7] DAY S, 1989, IEEE P E, V136, P85
  • [8] DEO N, 1980, IEEE P 1980 INT C PA, P244
  • [9] A DECOMPOSITION ALGORITHM FOR THE ALL-PAIRS SHORTEST-PATH PROBLEM ON MASSIVELY-PARALLEL COMPUTER ARCHITECTURES
    HABBAL, MB
    KOUTSOPOULOS, HN
    LERMAN, SR
    [J]. TRANSPORTATION SCIENCE, 1994, 28 (04) : 292 - 308
  • [10] KAUFMAN DE, 1993, IVHS J, V1, P91