Vehicle Routing Problem Model with Practicality

Abstract

Truck platooning has recently become an essential issue in automatic driving. Though truck platooning can increase safety and reduce fuel consumption and carbon emissions, the practical vehicle routing problem involved in truck platooning has not been sufficiently addressed. Therefore, we design a mixed-integer linear programming model for the routing problem in truck platooning considering the deadline of vehicles, continuous-time units, different fuel reduction rates, traffic congestion avoidance, and heterogeneous vehicles. In addition, a forward–backward heuristic called the “greedy heuristic” is presented for reasonable computation time. To validate the model’s performance, several parameters, such as the percentage of fuel reduction, percentage of detour vehicles, and percentage of platooned links (road segments), are considered. Additionally, various cases are considered with varying fuel reduction rates, traffic flow rates, and time windows. © 2023 by the authors.