Abstract The network models are often used to solve transport problems. In this paper authors propose such application in the field of finding optimal path in transport. Furthermore, a comparison with other known methods is described. This paper touches only the theoretical aspect of transport problems, but the results can be successfully applied to real transport systems.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Network Model of the Shortest Path Selection in Transport

    Dramski, M. / Maka, M. / Uchacz, W. | British Library Conference Proceedings | 2014


    Approximate Shortest Path Algorithms for Network-Tree Model

    Tan, G. / Han, X. / Zhao, Y. et al. | British Library Conference Proceedings | 2003


    Approximate shortest path algorithms for network-tree model

    Guozhen Tan, / Xiaojun Han, / Yilin Zhao, | IEEE | 2003



    Urban K shortest path obtaining method based on shortest path tree

    DING JIANXUN / YANG BEINUO / DUAN RUI et al. | European Patent Office | 2024

    Free access