Real-Time Cross-Fleet Pareto-Improving Truck Platoon Coordination
This paper studies a multi-fleet platoon coordination system in transport networks that deploy hubs to form trucks into platoons. The trucks belong to different fleets that are interested in increasing their profits by platooning across fleets. The profit of each fleet incorporates platooning rewards and costs for waiting at hubs. Each truck has a fixed route and a waiting time budget to spend at the hubs along its route. To ensure that all fleets are willing to participate in the system, we develop a cross-fleet Pareto-improving coordination strategy that guarantees higher fleet profits than a coordination strategy without cross-fleet platoons. By leveraging multiple hubs for platoon formation, the coordination strategy can be implemented in a real-time and distributed fashion while largely reducing the amount of travel information to be shared for system-wide coordination. We evaluate the proposed strategy in a simulation study over the Swedish transportation network. The cross-fleet platooning strategy significantly improves fleets' profits compared with single-fleet platooning, especially the profits from smaller fleets. The cross-fleet platooning strategy also shows strong competitiveness in terms of the system-wide profit compared to the case when a system planner optimizes all fleets' total profit.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Large-Scale Multi-Fleet Platoon Coordination: A Dynamic Programming Approach
Truck platooning is a promising technology that enables trucks to travel in formations with small inter-vehicle distances for improved aerodynamics and fuel economy. The real-world transportation system includes a vast n…
SchedulingQuantifying the Economic Case for Electric Semi-Trucks
There has been considerable interest in the electrification of freight transport, particularly heavy-duty trucks to downscale the greenhouse-gas (GHG) emissions from the transportation sector. However, the economic compe…
Autonomous VehiclesCertified-Gap Dual-Price Policies for Real-Time Truckload Bid Acceptance with Relocating, Clock-Constrained Resources
A truckload carrier must accept or reject each load tender within seconds. The decision depends on fleet state, hours-of-service (HOS) clocks, and appointment windows. We model this as a weakly coupled dynamic program in…
Considerate and Cooperative Model Predictive Control for Energy-Efficient Truck Platooning of Heterogeneous Fleets
Connectivity-enabled automation of distributed control systems allow for better anticipation of system disturbances and better prediction of the effects of actuator limitations on individual agents when incorporating a m…
Model Predictive ControlA metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
A vehicle routing and crew scheduling problem (VRCSP) consists of simultaneously planning the routes of a fleet of vehicles and scheduling the crews, where the vehicle-crew correspondence is not fixed through time. This …
Scheduling