At present, the path optimization method ignores the penalty cost generated by the time window constraint of the customer, resulting in the high penalty cost and the inability to obtain the optimal distribution path. Based on this, an optimization method for the logistics distribution vehicle path based on the improved ant colony algorithm is proposed. Complete genetic algorithm combining with improvements on ant colony algorithm, the model of logistics distribution vehicle routing problem is the objective function of the path planning problem, and according to the actual situation of distribution process and the conditions of specific requirements to set the terms of the objective function, to calculate the cost of fixed and variable costs to provide judgment for path optimization, design the arithmetic flow path optimization problem. In the example analysis, the logistics distribution of a fresh enterprise is selected as the example. The experimental results show that the total cost of the optimal path obtained by the design method is much lower than that of the traditional method, indicating that the proposed method is more practical.
濮明月, 张彦如. 基于改进蚁群算法的物流配送车辆路径优化方法
[J]. 吉林化工学院学报, 2021, 38(5): 90-94.
PU Mingyue, ZHANG Yanru. Vehicle Routing Optimization Method for Logistics Distribution based on Improved Ant Colony Algorithm
. Journal of Jilin Institute of Chemical Technology, 2021, 38(5): 90-94.