TY - JOUR
T1 - A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
AU - Ramos, Tânia Rodrigues Pereira
AU - Gomes, Maria Isabel
AU - Barbosa-Póvoa, Ana Paula
N1 - Tania Ramos and Ana Barbosa-Povoa acknowledge the support provided by FCT and P2020 under the project PTDC/EGE-OGE/28071/2017, Lisboa-01.0145-Feder-28071.
Maria Isabel Gomes acknowledges the support provided by FCT under the project UID/MAT/00297/2019 (Centro de Matematica e Aplicacoes).
PY - 2020/3
Y1 - 2020/3
N2 - 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.
AB - 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.
KW - Inter-depot routes
KW - Matheuristic
KW - Mixed integer linear programming
KW - Multiple depots
KW - Vehicle routing problem
UR - http://www.scopus.com/inward/record.url?scp=85075350919&partnerID=8YFLogxK
U2 - 10.1007/s00291-019-00568-7
DO - 10.1007/s00291-019-00568-7
M3 - Article
AN - SCOPUS:85075350919
SN - 0171-6468
VL - 42
SP - 75
EP - 110
JO - Or Spectrum
JF - Or Spectrum
IS - 1
ER -