车辆路径优化的实例研究
A Case Study of Vehicle Route Optimization
摘要:
在过去的几十年里,经典的车辆路径问题(VRP),即,已经深入研究了向车辆分配一组命令并规划它们的路线。由于只有车辆及其路线的订单分配已经是一个NP完全问题,这些算法在实践中的应用往往没有考虑到在现实世界中的应用,所谓的丰富的VRP(rVRP)的约束和限制,并仅限于单一方面。在这项工作中,我们将主要的相关现实世界的限制和要求。我们提出了一个两阶段的战略和时间轴算法的时间窗口和停顿时间,并分别应用遗传算法(GA)和蚁群优化(ACO)的问题,以找到最优解。我们对八个不同的问题实例对四个国家的最先进的算法的评估表明,我们的方法在合理的时间内处理所有给定的约束。
英文摘要:
In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already an NP-complete problem, the application of these algorithms in practice often fails to take into account the constraints and restrictions that apply in real-world applications, the so called rich VRP (rVRP) and are limited to single aspects. In this work, we incorporate the main relevant real-world constraints and requirements. We propose a two-stage strategy and a Timeline algorithm for time windows and pause times, and apply a Genetic Algorithm (GA) and Ant Colony Optimization (ACO) individually to the problem to find optimal solutions. Our evaluation of eight different problem instances against four state-of-the-art algorithms shows that our approach handles all given constraints in a reasonable time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。