Electric truck routing and platooning problem considering vehicle charging and driver assignment on highway networks

作者：Xiaoyuan Yan, Min Xu, Xiaotong Sun · 发表于：Transportation Research Part C Emerging Technologies · 年份：2025 · DOI：10.1016/j.trc.2025.105072 · 被引用次数：5 · 研究领域：Transportation and Mobility Innovations、Electric Vehicles and Infrastructure、Traffic control and management

• Vehicle charging and platooning are jointly considered in general highway networks. • Flexible driver assignment to different trucks is allowed. • A mixed-integer linear programming model is developed. • A customized arc set covering algorithm is proposed against three benchmark methods. • Extensive numerical experiments are conducted. Driven by the development of electricity-powered trucks and the connected and autonomous vehicle (CAV) technology, the electric truck (ET) routing and platooning has received considerable attention. To reap the labor cost savings and environmental benefits, this study makes the first attempt to investigate the ET routing and platooning problem considering vehicle charging and flexible assignment of the drivers. The objective is to determine the optimal routes and schedules of the trucks and the drivers that minimize the total operational cost to complete a group of freight transportation tasks while considering the features of the electric trucks, i.e., the limited driving range and charging demands due to limited battery capacity. A mixed-integer linear programming (MILP) model that can effectively determine the itineraries of the trucks and drivers and incorporate specific characteristics of ET platooning is formulated for the proposed problem. By exploring the essential features of the platooning process and its optimal solution structures, a tailor-designed edge set covering algorithm dedicated to platooning-related optimization problem i...