In this paper we describe an alternative variant dynamic Pickup and Delivery strategy of Vehicle Routing Problem (DVRP) which arises when new customers appear in the tours after starting visit. We propose an Artificial Ant Colony based on 2-Opt local search (AAC-2-Opt) to solve the DVRP. We demonstrate the effectiveness of our approach by comparing its results with those of existing methods in literature on the same tests problems. The proposed algorithm can efficiently optimize the routing problem and provide highly competitive solutions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On the performance of artificial ant colony to solve the dynamic vehicle routing problem


    Contributors:
    Euchi, J. (author) / Yassine, A. (author) / Chabchoub, H. (author)


    Publication date :

    2011-05-01


    Size :

    257243 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Approach to Solve the Dynamic Vehicle Routing Problem

    Toledo, C. F. M. / Aguilera, L. M. / Franca, P. M. et al. | British Library Conference Proceedings | 1998


    Artificial Bee Colony to solve seafaring staff scheduling problem: A real case

    Koubaa, Mayssa / Elloumi, Sonda / Dhouib, Souhail | IEEE | 2014


    Ant Colony optimization for the Electric Vehicle Routing Problem

    Mavrovouniotis, Michalis / Ellinas, Georgios / Polycarpou, Marios | IEEE | 2018