Document Open Access Logo

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

Authors Youcef Amarouche, Rym N. Guibadj, Aziz Moukrim

PDF
Thumbnail PDF

File

OASIcs.ATMOS.2018.11.pdf
  • Filesize: 0.59 MB
  • 15 pages

Document Identifiers

Author Details

Youcef Amarouche
  • Sorbonne universités, Université de technologie de Compiègne, CNRS, Heudiasyc UMR 7253, CS 60 319, 60 203 Compiègne cedex, France
Rym N. Guibadj
  • LISIC, Laboratoire d'Informatique Signal et Image de la Côte d'Opale, ULCO, Université Lille Nord-de-France, France
Aziz Moukrim
  • Sorbonne universités, Université de technologie de Compiègne, CNRS, Heudiasyc UMR 7253, CS 60 319, 60 203 Compiègne cedex, France

Funding

This work is supported by the French Environment and Energy Management Agency (ADEME), the Hauts-de-France region and the European Regional Development Fund (ERDF). It was carried out within the framework of the Labex MS2T, funded by the French Government (Reference ANR-11-IDEX-0004-02). It is also partially supported by TCDU project (Collaborative Transportation in Urban Distribution, ANR-14-CE22-0017).
  • Amarouche, Youcef: Agence de l'environnement et de la Maítrise de l'Energie 20, avenue du Grésillé - BP 90406, 49004, Angers Cedex 01, France

Cite AsGet BibTex

Youcef Amarouche, Rym N. Guibadj, and Aziz Moukrim. A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Open Access Series in Informatics (OASIcs), Volume 65, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/OASIcs.ATMOS.2018.11

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.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Optimization with randomized search heuristics
  • Applied computing → Transportation
Keywords
  • Two-Echelon Vehicle Routing Problem
  • City Logistics
  • hybrid method
  • integer programming

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Roberto Baldacci, Aristide Mingozzi, Roberto Roberti, and Roberto Wolfler Calvo. An exact algorithm for the two-echelon capacitated vehicle routing problem. Operations research, 61(2):298-314, 2013. Google Scholar
  2. U. Breunig, V. Schmid, R. F. Hartl, and T. Vidal. A large neighbourhood based heuristic for two-echelon routing problems. Computers and Operations Research, 76:208-225, 2016. Google Scholar
  3. Teodor Gabriel Crainic, Simona Mancini, Guido Perboli, and Roberto Tadei. Clustering-based heuristics for the two-echelon vehicle routing problem. CIRRELT-2008-46, 2008. Google Scholar
  4. Teodor Gabriel Crainic, Simona Mancini, Guido Perboli, and Roberto Tadei. Multi-start heuristics for the two-echelon vehicle routing problem. In Peter Merz and Jin-Kao Hao, editors, Evolutionary Computation in Combinatorial Optimization, pages 179-190, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg. Google Scholar
  5. Teodor Gabriel Crainic, Simona Mancini, Guido Perboli, and Roberto Tadei. GRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem. In Advances in Metaheuristics, pages 113-125. Springer New York, New York, NY, 2013. Google Scholar
  6. R Cuda, G Guastaroba, and M G Speranza. A survey on two-echelon routing problems. Computers & Operations Research, 55:185-199, 2015. Google Scholar
  7. Philippe Grangier, Michel Gendreau, Fabien Lehuédé, and Louis-Martin Rousseau. An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. European Journal of Operational Research, 254(1):80-91, 2016. Google Scholar
  8. Vera C Hemmelmayr, Jean-François Cordeau, and Teodor Gabriel Crainic. An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics. Computers & Operations Research, 39(12):3215-3228, 2012. Google Scholar
  9. Mads Jepsen, Simon Spoorendonk, and Stefan Ropke. A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transportation Science, 47(1):23-37, 2013. Google Scholar
  10. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2):498-516, 1973. Google Scholar
  11. Guido Perboli and Roberto Tadei. New families of valid inequalities for the two-echelon vehicle routing problem. Electronic notes in discrete mathematics, 36:639-646, 2010. Google Scholar
  12. Guido Perboli, Roberto Tadei, and Daniele Vigo. The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Science, 45(3):364-380, 2011. Google Scholar
  13. Jean-Yves Potvin and Jean-Marc Rousseau. An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society, 46(12):1433-1446, 1995. Google Scholar
  14. Yves Rochat and Éric D Taillard. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1):147-167, 1995. Google Scholar
  15. Fernando Afonso Santos, Alexandre Salles da Cunha, and Geraldo Robson Mateus. Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem. Optimization Letters, 7(7):1537-1547, 2013. Google Scholar
  16. Fernando Afonso Santos, Geraldo Robson Mateus, and Alexandre Salles da Cunha. A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Transportation Science, 49(2):355-368, 2014. Google Scholar
  17. Mehmet Soysal, Jacqueline M. Bloemhof-Ruwaard, and Tolga Bektaş. The time-dependent two-echelon capacitated vehicle routing problem with environmental considerations. International Journal of Production Economics, 164:366-378, jun 2015. Google Scholar
  18. Eiichi Taniguchi, Russell G. Thompson, Tadashi Yamada, and J.H.R. van Duin. City logistics –Network modelling and intelligent transport systems. Pergamon, Oxford, elsevier edition, 2001. Google Scholar
  19. Kangzhou Wang, Yeming Shao, and Weihua Zhou. Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service. Transportation Research Part D, 57(October):262-276, 2017. Google Scholar
  20. Zheng Yang Zeng, Wei Sheng Xu, Zhi Yu Xu, and Wei Hui Shao. A Hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics. Mathematical Problems in Engineering, 2014, 2014. Google Scholar
  21. Lin Zhou, Roberto Baldacci, Daniele Vigo, and Xu Wang. A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution. European Journal of Operational Research, 265(2):765-778, 2018. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact