西华大学学报（自然科学版）2017，Vol.36Issue(6)：6-12,7.DOI:10.3969/j.issn.1673-159X.2017.06.002
模拟退火蚁群算法在VRP问题上的应用
Combination Application of Simulated Annealing and Ant Colony Algorithm in VRP Optimization Problem
摘要
Abstract
Vehicle routing problem is the core problem of logistics system optimization, and the shortest path and the lowest cost are achieved when the relevant requirements are satistied.The VRP optimization problem and its solving method are analyzed.The principle and characteristics of simulated annealing and ant colony algorithm are studied.The idea and method of combination of simu-lated annealing algorithm and ant colony algorithm are proposed.The parameters of ant colony algorithm are improved, and the neigh-borhood algorithm is used to search the solution two times.The quality of the solution is optimized.It achieves the shortest path under the condition of relevant constraints.The results of this algorithm are compared with those of basic ant colony algorithm, modified ant colony algorithm and VRP website.Experimental results show that the proposed combination algorithm has a great improvement in time and accuracy, and has good application value.关键词
车辆路径/蚁群算法/二次搜索/模拟退火算法/邻域算法Key words
vehicle path/ant colony algorithm/quadratic search/simulated annealing algorithm/the neighborhood algorithm分类
信息技术与安全科学引用本文复制引用
张俊,张靖,宋雪勦..模拟退火蚁群算法在VRP问题上的应用[J].西华大学学报（自然科学版）,2017,36(6):6-12,7.基金项目
攀枝花市科技项目(2015cy-s-7). （2015cy-s-7）
