License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2018.11
URN: urn:nbn:de:0030-drops-97161
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9716/
Go to the corresponding OASIcs Volume Portal

Amarouche, Youcef ; Guibadj, Rym N. ; Moukrim, Aziz

A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem

pdf-format:
OASIcs-ATMOS-2018-11.pdf (0.6 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{amarouche_et_al:OASIcs:2018:9716,
  author =	{Youcef Amarouche and Rym N. Guibadj and Aziz Moukrim},
  title =	{{A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem}},
  booktitle =	{18th Workshop on Algorithmic Approaches for Transportation  Modelling, Optimization, and Systems (ATMOS 2018)},
  pages =	{11:1--11:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-096-5},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{65},
  editor =	{Ralf Bornd{\"o}rfer and Sabine Storandt},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9716},
  URN =		{urn:nbn:de:0030-drops-97161},
  doi =		{10.4230/OASIcs.ATMOS.2018.11},
  annote =	{Keywords: Two-Echelon Vehicle Routing Problem, City Logistics, hybrid method, integer programming}
}

Keywords: Two-Echelon Vehicle Routing Problem, City Logistics, hybrid method, integer programming
Collection: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
Issue Date: 2018
Date of publication: 28.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI