Research on distribution route with time window and on-board constraint based on tabu search algorithm

In order to solve the problem of the optimization of delivery and pickup cargoes’ routes with time windows under the constraints of load and road, the method and algorithm were designed and researched based on these factors. Firstly, the model was built with the constraints of truck number, load quality, load capacity, maximum distance, and customer service time in order to minimize the transportation cost and time cost. Then, the Floyd Algorithm was used to determine the moving path and the shortest distance between each point with the road constraint. 0-1 integer programming method was used to determine the number and type of vehicles. Tabu search algorithm was used to determine the order of delivery and pickup points and the distribution route based on the influence of job requirements of pickup cargoes, the time cost, and the transportation cost. Finally, the case was given to verify the effectiveness of the proposed method. This method can be used to improve the efficiency of delivery and pickup cargoes and the level of distribution service.