Vehicle Routing Problems (VRP) became a hot issue since few decades. However, before the optimization has started, almost all the work dealt with static information where all data is known in advance. Dynamic scheduling vehicle routes are a crucial management problem. In this paper, a dynamic vehicle routing problem based on real time traffic information is proposed and an adaptive algorithm is developed. Different response strategies are evaluated using dynamic path adaptive search method. The algorithm has been tested on a set of benchmarks that are defined, and it is tested on a realistic case study in road network of China. It confirms that the developed method can be applied to real world instances.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An Adaptive Algorithm for Dynamic Vehicle Routing Problem Based on Real Time Traffic Information


    Beteiligte:
    Huang, Deqi (Autor:in) / Yan, Xinping (Autor:in) / Chu, Xiuming (Autor:in) / Mao, Zhe (Autor:in)

    Kongress:

    First International Conference on Transportation Information and Safety (ICTIS) ; 2011 ; Wuhan, China


    Erschienen in:

    ICTIS 2011 ; 1736-1744


    Erscheinungsdatum :

    16.06.2011




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch