论文标题
多个车辆的动态双目标路由
Dynamic Bi-Objective Routing of Multiple Vehicles
论文作者
论文摘要
在实践中，例如在交付和服务方案中，车辆路由解决问题（VRP）通常意味着对动态客户请求的重复决策。与古典VRP一样，必须简短地计划游览，而在同一时间必须最大程度地提高服务客户的数量，从而导致多目标问题。但是，除此之外，动态要求导致需要重新规划尚未实现的巡回演出部分，而已经实现的旅行零件是不可逆转的。在本文中，我们研究了这种双向目标动态VRP，包括顺序决策和决策的同时实现。我们针对相关的VRP问题采用了最近提出的动态进化多目标算法（DEMOA），并将其扩展到多个车辆的更现实（此处考虑）方案。我们从经验上表明，我们的演示具有竞争性的竞争性，其脱机和千里眼的变体以及拟议中的杂物以及较早提出的动态单车方法具有竞争力。
In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.
