We studied a variant of the vehicle routing problem (VRP) arising in last-mile distribution, called the multi-depot two-echelon vehicle routing problem with delivery options (MDTEVRP-DO). The MDTEVRP-DO involves two decision levels: (i) designing routes for a fleet of vehicles located in multiple depots to transport customer demands to a set of satellites and (ii) routing a fleet of vehicles from the satellites to serve the final customers. Nowadays, a relevant feature of the problem characterizing delivery services is that customers can collect their packages at pickup stations near their homes or workplaces. We designed an effectively simulated annealing (SA) heuristic for the problem. The new algorithm was extensively tested on benchmark instances from the literature, and its results were compared with those of start-of-the-art algorithms. The results show that the proposed SA obtains 30 out of the 36 best solutions for the MDTEVRP-DO benchmark instances. Moreover, its computation performance is superior to state-of-the-art algorithms for the MDTEVRP-DO.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A fast simulated annealing heuristic for the multi-depot two-echelon vehicle routing problem with delivery options


    Additional title:

    V. F. YU ET AL.
    TRANSPORTATION LETTERS


    Contributors:

    Published in:

    Transportation Letters ; 16 , 8 ; 921-932


    Publication date :

    2024-09-13


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution

    Zhou, Lin / Baldacci, Roberto / Vigo, Daniele et al. | BASE | 2018

    Free access

    A multi-objective two-echelon vehicle routing problem with multiple delivery options

    Karimi, Amin / Zhang, Lele / Fackrell, Mark et al. | Elsevier | 2024

    Free access

    A Fast Look-ahead Heuristic for the Multi-depot Vehicle Routing Problem

    Branke, Jürgen / Schmidt, Christian / Withopf, Markus | DataCite | 2007

    Free access

    A Simulated Annealing Heuristic for the Green Vehicle Routing Problem

    Yasin, Moch / Yu, Vincent F. | Springer Verlag | 2013


    A tabu search heuristic for the multi-depot vehicle routing problem

    Renaud, Jacques / Laporte, Gilbert / Boctor, Fayez F. | TIBKAT | 1994