Planning of truck platooning for road-network capacitated vehicle routing problem

Yilang Hao, Zhibin Chen, Xiaotong Sun and Lu Tong

Transportation Research Part E: Logistics and Transportation Review, 2025, vol. 194, issue C

Abstract: Truck platooning, a linking technology of trucks on the highway, has gained enormous attention in recent years due to its benefits in energy and operation cost savings. However, most existing studies on truck platooning limit their focus on particular scenarios that each truck can serve only one customer demand and is thus with a specified origin–destination pair, so only routing and time schedules are taken into account. Nevertheless, in real-world logistics, each truck may need to serve multiple customers located at different places, and the operator managing a fleet of trucks thus has to determine not only the routing and time schedules of each truck but also the set of customers allocated to each truck and their sequence to visit. This is well known as a capacitated vehicle routing problem with time windows (CVRPTW), and considering the application of truck platooning in such a problem entails new modeling frameworks and tailored solution algorithms. In light of this, this study makes the first attempt to optimize the truck platooning plan for a road-network CVRPTW in a way to minimize the total operation cost, including vehicles’ fixed dispatch cost and energy cost, while fulfilling all delivery demands within their time window constraints. Specifically, the operation plan will dictate the number of trucks to be dispatched, the set of customers, and the routing and time schedules for each truck. In addition, the modeling framework is constructed based on a road network instead of a traditional customer node graph to better resemble and facilitate the platooning operation. A 3-stage algorithm embedded with a ”route-then-schedule” scheme, Dynamic Programming, and Modified Insertion heuristic, is developed to solve the proposed model in a timely manner. Numerical experiments are conducted to validate the proposed modeling framework, demonstrate the performance of the proposed solution algorithm, and quantify the benefit brought by the truck platooning technology.

Keywords: Truck platooning; Vehicle routing problem; Route then schedule; Dynamic programming; Modified insertion heuristic (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554524004897
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:194:y:2025:i:c:s1366554524004897

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2024.103898

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().