Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

    A Massively Parallel Time‐Dependent Least‐Time‐Path Algorithm for Intelligent Transportation Systems Applications

    This article is concerned with the problem of computing in parallel time‐dependent least‐time paths that can be used in real‐time intelligent transportation systems applications. A message‐passing scheme is presented, and its correctness is proved. The algorithm's computational complexity is shown to be O(|T|2|V|2), an improvement by |V| over the best‐known sequential algorithm. The algorithm is implemented, coded, and computationally tested on actual and random networks with promising results. The algorithm is implemented on a CRAY‐T3D supercomputer using a Parallel Virtual Machine environment that allows portability to lower‐end multiprocessor machines.

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    A Massively Parallel Time‐Dependent Least‐Time‐Path Algorithm for Intelligent Transportation Systems Applications

    This article is concerned with the problem of computing in parallel time‐dependent least‐time paths that can be used in real‐time intelligent transportation systems applications. A message‐passing scheme is presented, and its correctness is proved. The algorithm's computational complexity is shown to be O(|T|2|V|2), an improvement by |V| over the best‐known sequential algorithm. The algorithm is implemented, coded, and computationally tested on actual and random networks with promising results. The algorithm is implemented on a CRAY‐T3D supercomputer using a Parallel Virtual Machine environment that allows portability to lower‐end multiprocessor machines.

    Access

    Check access
    Check availability in my library
    Order at Subito €

    A Massively Parallel Time‐Dependent Least‐Time‐Path Algorithm for Intelligent Transportation Systems Applications

    This article is concerned with the problem of computing in parallel time‐dependent least‐time paths that can be used in real‐time intelligent transportation systems applications. A message‐passing scheme is presented, and its correctness is proved. The algorithm's computational complexity is shown to be O(|T|2|V|2), an improvement by |V| over the best‐known sequential algorithm. The algorithm is implemented, coded, and computationally tested on actual and random networks with promising results. The algorithm is implemented on a CRAY‐T3D supercomputer using a Parallel Virtual Machine environment that allows portability to lower‐end multiprocessor machines.

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Access

    Check access
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    Document information
    Title:

    A Massively Parallel Time‐Dependent Least‐Time‐Path Algorithm for Intelligent Transportation Systems Applications

    Contributors:

    Ziliaskopoulos, Athanasios (author) / Kotzinos, Dimitrios (author)

    Published in:

    Computer‐Aided Civil and Infrastructure Engineering ; 16 ; 337-346

    Publication date:

    2001-09-01

    Size:

    10 pages

    ISSN:

    1093-9687 , 1467-8667

    DOI:

    https://doi.org/10.1111/0885-9507.00237

    Type of media:

    Article (Journal)

    Type of material:

    Electronic Resource

    Language:

    English

    Similar titles

    A Massively Parallel Time-Dependent Least-Time-Path Algorithm for Intelligent Transportation Systems Applications

    Ziliaskopoulos, A. | Online Contents | 2001

    Least-cost path in public transportation systems with fare rebates that are path- and time-dependent

    Jinsong Tan, / Hon Wai Leong, | IEEE | 2004

    Time-Dependent, Shortest-Path Algorithm for Real-Time Intelligent Vehicle Highway System Applications

    Ziliaskopoulos, A. K. / Mahmassani, H. S. | British Library Online Contents | 1993

    Design and Implementation of Parallel Dynamic Shortest Path Algorithms for Intelligent Transportation Systems Applications

    Chabini, I. / Ganugapati, S. | British Library Online Contents | 2001

    Time Dependent Shortest Path on Urban Transportation Network

    Hung, M.-C. / Wu, Y.-H. / Urban and Regional Information Systems Association | British Library Conference Proceedings | 2005

    Back to top