In this paper, we study weakly dynamic undirected graphs, and we propose an efficient polynomial algorithm that computes in advance alternative shortest paths for all possible configurations. No additional computation is then needed after any change in the problem because shortest paths are already known in all cases. We use these results to compute critical values for the traversal duration and to pre-compute best paths, and we apply this result to one delivery problem for trucks from one regional storehouse to several local stores when one possible point has a variable traversal duration.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Route planning in a weakly dynamic undirected graph




    Publication date :

    2013-05-01


    Size :

    968542 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Distributed IE for MASs with Undirected Graph

    Zhu, Jun-Wei / Wang, Xin / Yang, Guang-Hong | Springer Verlag | 2022


    Object-oriented undirected graph model in P&ID design system

    Guoshun, H. / Jinghua, L. / Shicai, L. | British Library Online Contents | 2004


    Rotation-Matrix-Based Attitude Tracking Under an Undirected Tree Graph

    Chen, Ti / Shan, Jinjun / Wen, Hao | Springer Verlag | 2022


    DYNAMIC ROUTE PLANNING DEVICE AND DYNAMIC ROUTE PLANNING METHOD

    YOSHINO KYOJI | European Patent Office | 2024

    Free access

    Dynamic Route Planning

    RAKAH YARON / SHOVAL OREN / RAMOT DANIEL et al. | European Patent Office | 2018

    Free access