STUDY OF VRP SIMULATION BASED ON IMPROVED ANT COLONY ALGORITHM
Based on the defects of ant colony algorithm, such as slow convergence, easy to be trapped in local optimum, this paper put forward an improved ant colony algorithm. Through observing the vehicle load factor, the changes of strength of heuristic information on the search path is adjusted. The local pheromone update and global update strategy are used in the effective path and 3-opt optimization is applied in the sub-feasible solution. Based on the achieving of local optimum, the global optimum of feasible solution can be guranteed. The results of simulation, which takes 22 city vehicles on the path for instance, show that compared with basic ant colony algorithm, the improved algorithm performs better, increasing the convergence rate by nearly 60％. The algorithm can help to obtain a satisfactory optimal solution to the large scale problem.
simulation logistics ant colony algorithm Vehicle Routing Problem
Z.L.Liu Y.M.Yang
Department of Mathematics and Computer of North-SiChuan Medical Colleg,NanChong, SiChuan,637007,Chin Mathematics & Information College Of West China Normal Unvisersity NanChong, SiChuan , 637007 ,Chin
国际会议
2012 International Conference on System Simulation(2012年国际系统仿真学术会议)
上海
英文
278-282
2012-04-06（万方平台首次上网日期，不代表论文的发表时间）