The increasing linkage of route guidance servers within the recent years leads to numerous efforts to split traffic assignment algorithms in an efficient way on these distributed computers. Especially in the field of intermodal services, i.e. calculating the fastest paths of certain origin-destination pairs with respect to different individual and public traffic services, solutions are required to implement the routing models in a fast, reliable way. Unfortunately, analysis of different realizations is commonly done by comparing the amount of necessary instructions O(.) in different net topologies. However, as computing power is in the meanwhile at a fairly high level, delay in a distributed environment can mainly be expected due to communication time. Dynamic calculations demand to transmit actual traffic conditions during several time periods, thus this paper examines the different routing strategies by evaluating the occuring message transmission time in common graph classes. It will be shown that possessing a star topology (one central server) Label-Setting algorithms can be proved to be superior in regard to Label-Correcting algorithms. In addition, considerable improvements will be achieved by parallel message transfer for possible next link investigations. Here, the paper proposes solutions with a profit in delays by a factor of O'(n), where n denotes the number of nodes in a network.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Evaluation of shortest path algorithms in a distributed traffic assignment environment


    Additional title:

    Bewertung des kürzesten Wegalgorithmus in einer verteilten Verkehrszuordnungsumgebung


    Contributors:
    Kriesten, R. (author) / Kiencke, U. (author)


    Publication date :

    2003


    Size :

    6 Seiten, 1 Bild, 2 Tabellen, 11 Quellen




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment

    Kriesten, R. / Kiencke, U. / Society of Automotive Engineers | British Library Conference Proceedings | 2003


    Evaluation of Shortest Path Algorithms in a Distributed Traffic Assignment Environment

    Kriesten, Reiner / Kiencke, Uwe | SAE Technical Papers | 2003


    Evaluation of shortest path algorithms in a distributed traffic assignment environment

    Kriesten,R. / Kiencke,U. / Univ.Karlsruhe,DE | Automotive engineering | 2003


    Traffic assignment by shortest path method using TD factor

    Benesh, A.H. | Engineering Index Backfile | 1967


    Efficient shortest path algorithms for road traffic optimization

    Richter,P. / Univ.Potsdam,DE | Automotive engineering | 1994