Abstract This paper presents an algorithm with movement prohibitions which eliminates some problems encountered in network representation used for traffic assignment models, and further allows the representation of the network to be simplified. The paper first presents an appraisal of some proposed methods and reviews the basic concept of existing shortest-route algorithms. The problem of obtaining shortest routes in networks with movement prohibitions is formulated and an algorithm presented. The computational procedure is illustrated by means of a numerical example. The computational efficiency of the algorithm is tested and the test results show that the algorithm is very efficient.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Shortest route algorithm with movement prohibitions


    Contributors:

    Published in:

    Publication date :

    1984-06-08


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A Closer Examination of Overtaking Prohibitions for Trucks

    Hoogendoorn, S. P. / Bovy, P. H. L. / International Federation of Automatic Control | British Library Conference Proceedings | 2001


    Handling materials via the shortest route

    Engineering Index Backfile | 1928



    Method for calculating shortest distance navigation route

    YU LEIYI / LIU KUN | European Patent Office | 2023

    Free access