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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Weitere Titelangaben:

    V. F. YU ET AL.
    TRANSPORTATION LETTERS


    Beteiligte:
    Yu, Vincent F. (Autor:in) / Lin, Shih-Wei (Autor:in) / Zhou, Lin (Autor:in) / Baldacci, Roberto (Autor:in)

    Erschienen in:

    Transportation Letters ; 16 , 8 ; 921-932


    Erscheinungsdatum :

    13.09.2024


    Format / Umfang :

    12 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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

    Freier Zugriff

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

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

    Freier Zugriff

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

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

    Freier Zugriff

    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