论文标题
集线器的卡车排组：最佳释放时间规则
Truck Platoon Formation at Hubs: An Optimal Release Time Rule
论文作者
论文摘要
我们考虑了一个基于集线器的排协调问题，其中车辆根据独立且分布的随机到达过程到达集线器。车辆在轮毂上等待，每个时间步长的排协调员决定是以排的形式从轮毂中释放车辆，还是等待更多的车辆到达。排释放时间问题被建模为停止规则问题，其中目的是最大程度地利用位于轮毂上的车辆的平均排成平均益处，并且要在枢纽等待车辆的成本。我们表明，停止规则问题是单调，因此最佳的排释放时间策略将以一个时间步长的规则的形式。最佳释放规则的性能与（i）定期发布时间规则和（ii）的非因果释放时间规则进行比较，其中协调员知道到达过程的所有未来实现。我们的数值结果表明，最佳释放时间规则可以达到与非因果规则的绩效，并胜过周期性规则，尤其是当到达率较低时。
We consider a hub-based platoon coordination problem in which vehicles arrive at a hub according to an independent and identically distributed stochastic arrival process. The vehicles wait at the hub, and a platoon coordinator, at each time-step, decides whether to release the vehicles from the hub in the form of a platoon or wait for more vehicles to arrive. The platoon release time problem is modeled as a stopping rule problem wherein the objective is to maximize the average platooning benefit of the vehicles located at the hub and there is a cost of having vehicles waiting at the hub. We show that the stopping rule problem is monotone and the optimal platoon release time policy will therefore be in the form of a one time-step look-ahead rule. The performance of the optimal release rule is numerically compared with (i) a periodic release time rule and (ii) a non-causal release time rule where the coordinator knows all the future realizations of the arrival process. Our numerical results show that the optimal release time rule achieves a close performance to that of the non-causal rule and outperforms the periodic rule, especially when the arrival rate is low.
