论文标题

在服务时间法规下,用于排协调的近似动态编程

Approximate Dynamic Programming for Platoon Coordination under Hours-of-Service Regulations

论文作者

Bai, Ting, Johansson, Alexander, Johansson, Karl Henrik, Mårtensson, Jonas

论文摘要

根据驾驶和休息时间法规,卡车司机必须在一定规律的情况下停止和休息,这也称为服务时间(HOS)法规。本文研究了在考虑现实的HOS法规时最佳形成排的问题。在我们的问题中,卡车在运输网络中具有固定的路线,可以在其路线上等待与他人一起形成排的枢纽,同时满足驾驶和休息时间的限制。我们提出了一个分布式决策计划,每个卡车都会根据其他人的预测时间表来控制枢纽的等待时间。卡车的决策构成的脱钩有助于在HOS法规下采用排行协调的近似动态编程方法。最后,我们使用一千辆卡车对瑞典道路网络进行了模拟,以评估欧盟(EU)HOS法规所达到的排量收益。仿真结果表明,如果允许将每辆卡车延迟到其总旅行时间的5%,则平均而言,卡车在排行管中以37%的路线开车。如果不允许卡车延迟,他们将以12%的路线行驶。

Truck drivers are required to stop and rest with a certain regularity according to the driving and rest time regulations, also called Hours-of-Service (HoS) regulations. This paper studies the problem of optimally forming platoons when considering realistic HoS regulations. In our problem, trucks have fixed routes in a transportation network and can wait at hubs along their routes to form platoons with others while fulfilling the driving and rest time constraints. We propose a distributed decision-making scheme where each truck controls its waiting times at hubs based on the predicted schedules of others. The decoupling of trucks' decision-makings contributes to an approximate dynamic programming approach for platoon coordination under HoS regulations. Finally, we perform a simulation over the Swedish road network with one thousand trucks to evaluate the achieved platooning benefits under the HoS regulations in the European Union (EU). The simulation results show that, on average, trucks drive in platoons for 37% of their routes if each truck is allowed to be delayed for 5% of its total travel time. If trucks are not allowed to be delayed, they drive in platoons for 12% of their routes.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源