Optimization of Logistics Distribution Path in Multiple Distribution Centers by Improved Ant Colony Algorithm
Improved Ant Colony Algorithm(IACO)is a solution to optimizing the vehicle routing problems with soft time windows(VRPSTW)based on traditional Ant Colony Algorithm(ACO).Firstly,the penalty method is used to segment customer points and match the distribution center to find the initial solution. Secondly,a new pheromone update formula is introduced.Finally,the insertion operator and inversion oper-ator are used for variable neighborhood search to obtain the optimization sequence.Comparing the differ-ences in the process and results of the two algorithms,the results show that the improved algorithm has the advantage of improving the early solving speed and result solving ability compared to traditional algo-rithms under the premise of multiple distribution centers.Multiple distribution centers with soft time win-dows can better consider costs and customer satisfaction,and also better meet the actual needs of enterpri-ses and users for path optimization.
Ant Colony Algorithmpenalty methodvariable neighborhood searchsoft time windowcustomer satisfaction
国家科技期刊平台
NSTL
万方数据
