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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic vehicle routing problem using hybrid ant system


    Contributors:
    Yan Tian, (author) / Jingyan Song, (author) / Danya Yao, (author) / Jianming Hu, (author)


    Publication date :

    2003-01-01


    Size :

    325521 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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

    Free access

    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

    Free access

    Vehicle Routing Problem

    Balaji, Bharathan | DataCite | 2024