A Vehicle Routing Problem Based on a Long-Distance Transportation Network with an Exact Optimization Algorithm

In vehicle routing problems, long-distance transportation poses a significant challenge to the optimization of transportation costs while adhering to regulations. This study investigates a special type of logistics problem that focuses on liquid transportation systems involving full truckload delivery and the rest–break–drive periods of truck drivers over long distances according to the regulations of the United States. Based on an exact solution algorithm, this work combines a long-distance full truckload fluid transportation problem with the concept of truck driver schedules for the first time. The goal is to optimize transportation expenses while managing challenges related to the rest–break–drive periods of truck drivers, time windows, trailer varieties, customer segments, food and non-food products, a diverse fleet, starting locations, and the diverse tasks of vehicles. In order to reach optimality, a construction heuristic and the column generation method were employed, supplemented by several acceleration strategies. Performance analysis, carried out with artificial input sets mirroring real-life scenarios, indicates that low optimality gaps can be obtained in an appropriate amount of time for large-scale long-haul liquid transportation.