论文标题
多驱动多部队多段车辆路由，总完成时间最小化
Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization
论文作者
论文摘要
无人驾驶飞机（UAV）是飞机，其飞行可以完全自主，而无需任何人为干预。自然灾害管理是可以使用无人机的最有用和最有希望的领域之一。 在本文中，我们专注于紧急情况，并建议使用一组无人机，以帮助营救团队个性化受影响区域内需要帮助的人。我们将这种情况建模为原始图理论问题，称为多驱动多部门路线路由问题，总完成时间最小化（MDMT-VRP-TCT）；我们经历了一些与之相似的文献中已经研究的问题，并突出了差异，提出了将我们问题作为MILP的数学表述，设计了一种数学框架来快速解决大型实例，并在实验中测试其性能。除了提出的应用程序之外，我们的解决方案在任何情况下都必须解决多部多行车路由问题的任何情况。
Unmanned aerial vehicles (UAVs) are aircraft whose flights can be fully autonomous without any provision for human intervention. One of the most useful and promising domains where UAVs can be employed is natural disaster management. In this paper, we focus on an emergency scenario and propose the use of a fleet of UAVs that help rescue teams to individuate people needing help inside an affected area. We model this situation as an original graph theoretical problem called Multi-Depot Multi-Trip Vehicle Routing Problem with Total Completion Times minimization (MDMT-VRP-TCT); we go through some problems already studied in the literature that appear somehow similar to it and highlight the differences, propose a mathematical formulation for our problem as a MILP, design a matheuristic framework to quickly solve large instances, and experimentally test its performance. Beyond the proposed application, our solution works in any case in which a multi-depot multi-trip vehicle routing problem must be solved.
