A Matheuristic for Multi-Depot Multi-Trip Vehicle Routing Problems

被引：0

作者：

Calamoneri, Tiziana ^{[1
]}

Coro, Federico ^{[2
]}

Mancini, Simona ^{[3
,4
]}

机构：

[1] Sapienza Univ Rome, Rome, Italy

[2] Missouri Univ Sci & Technol, Rolla, MO 65409 USA

[3] Univ Palermo, Palermo, Italy

[4] Univ Klagenfurt, Klagenfurt Am Worthersee, Austria

来源：

METAHEURISTICS, MIC 2022 | 2023年 / 13838卷

关键词：

Matheuristic; Multi-trip; Multi-depot; Vehicle routing problems; Total completion time minimization;

D O I：

10.1007/978-3-031-26504-4_34

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：464 / 469

页数：6

共 5 条

[1] The multiple traveling salesman problem: an overview of formulations and solution procedures [J].