Starting from a real-life application, in this short paper, we propose the original Multi-Depot Multi-Trip Vehicle Routing Problem with Total Completion Times minimization (MDMT-VRP-TCT). For it, we propose a mathematical formulation as a MILP, design a matheuristic framework to quickly solve it, and experimentally test its performance. It is worth noting that this problem is original as in the literature its characteristics (i.e., multi-depot, multi-trip and total completion time) can be found separately, but never all together. Moreover, regardless of the application, our solution works in any case in which a multi-depot multi-trip vehicle routing problem must be solved.
A matheuristic for multi-depot multi-trip vehicle routing problems / Calamoneri, Tiziana; Corò, Federico; Mancini, Simona. - 13838:(2023), pp. 464-469. (Intervento presentato al convegno Metaheuristics International Conference (MIC 2022) tenutosi a Syracuse; Italy) [10.1007/978-3-031-26504-4_34].
A matheuristic for multi-depot multi-trip vehicle routing problems
Calamoneri, Tiziana
Membro del Collaboration Group
;Corò, FedericoMembro del Collaboration Group
;
2023
Abstract
Starting from a real-life application, in this short paper, we propose the original Multi-Depot Multi-Trip Vehicle Routing Problem with Total Completion Times minimization (MDMT-VRP-TCT). For it, we propose a mathematical formulation as a MILP, design a matheuristic framework to quickly solve it, and experimentally test its performance. It is worth noting that this problem is original as in the literature its characteristics (i.e., multi-depot, multi-trip and total completion time) can be found separately, but never all together. Moreover, regardless of the application, our solution works in any case in which a multi-depot multi-trip vehicle routing problem must be solved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
