论文标题
在树网络上进行协调的车辆排：有效的时间离散和加强配方
Coordinated Vehicle Platooning on Tree Networks: Efficient Time Discretization and Strengthened Formulation
论文作者
论文摘要
我们考虑在树网络上使用时间限制的在树网络上的协调车辆排出问题，同时给出了车辆路线。问题是协调每辆车的出发时间，以使排构成使总节省总量。对于此问题设置，可以为所有可以应用有效时间离散化的车辆定义相对时间窗口。与涉及我们以前的工作中提出的大型M系数的连续时间配方相比，该属性导致了紧密的混合企业线性程序重新制定。系统的数值实验证明，重新制定的表现优于这个问题家族实例的连续时间配方。
We consider the coordinated vehicle platooning problem on a tree network with time constraints while the routes of vehicles are given. The problem is to coordinate the departure time of each vehicle to enable platoon formation hence maximizing the total fuel saving. For this problem setting, relative time windows can be defined for all vehicles to which an efficient time discretization can be applied. This property leads to a tight mixed-integer linear program reformulation as compared to the continuous-time formulation involving big-M coefficients proposed in our previous work. It is demonstrated by systematic numerical experiments that the reformulation outperforms the continuous-time formulation for this family of problem instances.
