A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes

Tânia Rodrigues Pereira Ramos, Maria Isabel Gomes, Ana Paula Barbosa-Póvoa

Research output: Contribution to journalArticle

Abstract

The multi-depot vehicle routing problem with inter-depot routes is studied in this paper, where vehicles may reset their capacity at any depot during the working day. Due to the complexity of this problem, exact approaches are limited to small-size applications. In order to overcome this limitation, we propose a matheuristic which integrates a mixed integer linear programming formulation with a set of relax-and-fix strategies. This solution approach is shown to be very efficient, and for the first time, large-size benchmarking instances are solved.

Original languageEnglish
Pages (from-to)75-110
JournalOr Spectrum
Volume42
Issue number1
DOIs
Publication statusPublished - Mar 2020

Keywords

  • Inter-depot routes
  • Matheuristic
  • Mixed integer linear programming
  • Multiple depots
  • Vehicle routing problem

Fingerprint Dive into the research topics of 'A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes'. Together they form a unique fingerprint.

  • Cite this