关键词: 自动导引车, 配送路径规划, 车辆路径问题, 禁忌搜索, 需求依订单拆分, 软时间窗

Abstract: To improve the work efficiency and reduce the distribution cost,the material distribution route planning problem for multiple automated guided vehicles was analyzed,and it was formulated as a vehicle routing problem with soft time windows and split deliveries by order.By taking the minimum number of automated guided vehicles utilization,the lowest total travel cost and the time window deviation as the first and second optimization objective respectively,and combining with constraints such as the maximum route length,vehicle capacity,split deliveries by order and the satisfaction rate of time window,a corresponding mathematical model was constructed.An adaptive tabu search algorithm was designed to solve the problem.To enhance the searching capability,some strategies such as adaptability,random tabu length and reinitializing tabu list were added to the algorithm.Computational results by the proposed algorithm on Solomn benchmark problems were provided and compared with other methods in the literature.The comparison results showed that more savings on both the number of automated guided vehicles used and the travel cost were obtained,and the results were equal to or close to the best known solutions for benchmark problems in the literature,which reflected the effectiveness of the algorithm.

Key words: automated guided vehicle, distribution routing planning, vehicle routing problem, tabu search, split deliveries by order, soft time windows