A tabu search algorithm for distribution network optimization with discrete split deliveries and soft time windows

To save the distribution network costs, the vehicle routing problem with split deliveries by order and soft time windows is studied. In this paper, the flexibility of the distribution system is enhanced via soft time windows, the requirement for non-split deliveries is loosened, and a new form of discrete split deliveries is defined. The new form of split deliveries by order is agreed for splitting. Giving considerations to split deliveries by order, soft time windows and working time constraints, a corresponding multi-objective mathematical model is constructed, and an adaptive tabu search algorithm with dynamic tabu list and multi-neighborhood structure is designed to solve the problem. The effectiveness of the new algorithm is verified by the example testing and comparison.