The dynamic vehicle routing problem, DVRP, consists in optimally routing a fleet occur at random. The optimization consists in finding the solution that minimizes the total length of tours and satisfying the customer delivery time window. In this paper, we present a hybrid ant system to handle the dynamism by means of modifying the pheromone matrix and candidate sets strategy. In addition, we make further improvements on vehicle routes with the local search heuristics. The results show that the hybrid ant system works effectively to find competitive solutions.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Dynamic vehicle routing problem using hybrid ant system


    Beteiligte:
    Yan Tian, (Autor:in) / Jingyan Song, (Autor:in) / Danya Yao, (Autor:in) / Jianming Hu, (Autor:in)


    Erscheinungsdatum :

    01.01.2003


    Format / Umfang :

    325521 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Dynamic Vehicle Routing Problem Using Hybrid Ant System

    Tian, Y. / Song, J. / Yao, D. et al. | British Library Conference Proceedings | 2003


    Dynamic-stochastic vehicle routing and inventory problem

    Maqueo, Rodrigo Rubio | DSpace@MIT | 1995

    Freier Zugriff

    Dynamic Vehicle Routing Problem with Multiple Objectives

    Tang, Hao / Hu, Mingwei | Transportation Research Record | 2005


    Solving a Dynamic Real-Life Vehicle Routing Problem

    Goel, Asvin / Gruhn, Volker | BASE | 2006

    Freier Zugriff

    Vehicle Routing Problem

    Liu, Baoding | Springer Verlag | 2009