Itinerary planning for cooperative truck platooning

A cooperative truck platoon is a set of virtually linked trucks driving with a small intra-vehicle headway enabled by connected and automated vehicle technologies. One of the primary benefits of truck platooning is energy savings due to the reduction of aerodynamic drag on the platooned vehicles. Th...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part B: methodological 2021-11, Vol.153, p.91-110
Main Authors: Abdolmaleki, Mojtaba, Shahabi, Mehrdad, Yin, Yafeng, Masoud, Neda
Format: Article
Language:English
Subjects:
Aerodynamic drag
Algorithms
Approximation
Approximation algorithm
Concave minimum cost flow
Drag reduction
Energy conservation
Headways
Itinerary planning
Mixed integer
Optimization
Outer approximation
Platooning
Truck platooning
Trucks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A cooperative truck platoon is a set of virtually linked trucks driving with a small intra-vehicle headway enabled by connected and automated vehicle technologies. One of the primary benefits of truck platooning is energy savings due to the reduction of aerodynamic drag on the platooned vehicles. The focus of this paper is on scheduling travel itineraries of a given set of trucks to facilitate the formation of platoons to maximize energy savings. By constructing a time-expanded network, we formulate the problem as a minimum concave-cost network flow problem, and devise a few solution methods to find the optimal or high-quality solutions. The solution methods include an outer approximation algorithm for solving a mixed-integer convex minimization reformulation of the problem, a dynamic-programming-based heuristic scalable to large-scale instances, and a fast approximation algorithm with guaranteed performance for a restrictive version of the problem. All the proposed algorithms are examined and benchmarked on medium to large networks under various test scenarios. The numerical results demonstrate the efficiency of the proposed methods and their applicability in real-world settings. •Formulate truck platooning planning as a minimum concave-cost network flow problem.•Develop a hybrid outer approximation/local search algorithm for medium-sized problems.•Propose a dynamic-programming-based heuristic for large-scale problems.•Devise an approximation algorithm for a special-case truck platooning problem.
ISSN:0191-2615
1879-2367
DOI:10.1016/j.trb.2021.08.016