论文标题
重复的路线 - 安排的方法，用于协调车辆的排队：算法，有效的不平等和计算
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation
论文作者
论文摘要
车辆的排是减少燃油消耗，提高车辆安全性以及更有效地使用道路空间的一种有希望的方法。我们认为将最佳路线和出发时间表分配给车辆集合的重要问题。我们提出了一种迭代路线，然后提出了用于集中计划的启发式启发式，该计划迅速汇聚为高质量的解决方案。我们还建议和分析有效不平等的集合，以将车辆分配到路线和安排车辆穿越其路线的时代的各个问题。这些不平等现象可减少解决路由和调度问题实例的计算时间或最佳差距。我们的方法在每次迭代的路由和调度部分中都使用有效的不平等。数值实验突出了在现实世界网络上路由车辆的方法的速度。
Platooning of vehicles is a promising approach for reducing fuel consumption, increasing vehicle safety, and using road space more efficiently. We consider the important but difficult problem of assigning optimal routes and departure schedules to a collection of vehicles. We propose an iterative route-then-schedule heuristic for centralized planning that quickly converges to high-quality solutions. We also propose and analyze a collection of valid inequalities for the individual problems of assigning vehicles to routes and scheduling the times that vehicles traverse their routes. These inequalities are shown to reduce the computational time or optimality gap of solving the routing and scheduling problem instances. Our approach uses the valid inequalities in both the routing and scheduling portions of each iteration; numerical experiments highlight the speed of the approach for routing vehicles on a real-world road network.
