2026-07-20T06:35:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9716 2024-03-06T10:30:27Z ddc:004 open_access

A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem Amarouche, Youcef Guibadj, Rym N. Moukrim, Aziz Two-Echelon Vehicle Routing Problem City Logistics hybrid method integer programming The Two-Echelon Vehicle Routing Problem (2E-VRP) is a variant of the classical vehicle routing problem arising in the context of city logistics. In the 2E-VRP, freight from a main depot is delivered to final customers using intermediate facilities, called satellites. In this paper, we propose a new hybrid heuristic method for solving the 2E-VRP that relies on two components. The first component effectively explores the search space in order to discover a set of interesting routes. The second recombines the discovered routes into high-quality solutions. Experimentations on benchmark instances show the performance of our approach: our algorithm achieves high-quality solutions in short computational times and improves the current best known solutions for several large scale instances. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Youcef Amarouche and Rym N. Guibadj and Aziz Moukrim 2018 Is Part Of OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2018.11 urn:nbn:de:0030-drops-97161 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.11 eng https://creativecommons.org/licenses/by/3.0/legalcode