An Adaptive Tabu Search Algorithm for the Open Vehicle Routing Problem with Split Deliveries by Order

In order to reduce the cost of logistics distribution, a capacitated open vehicle routing problem with split deliveries by order is studied. According to the actual situation of split deliveries by order in the practice of logistics distribution, the condition of non-split in the traditional open vehicle routing problem is relaxed, and a new form of discrete split deliveries by order is designed. Based on the classical model of open vehicle routing problem, a corresponding double objective mathematical model with split deliveries by order is established, and an adaptive tabu search algorithm is designed to solve the problem. In order to improve the optimization performance, an adaptive penalty mechanism is designed, a multiple neighborhood structure is constructed, and the tabu list is reinitialized. The comparison with other methods in the literature shows the effectiveness of the algorithm.