计算机技术与发展2016，Vol.26Issue(3)：27-30,35,5.DOI:10.3969/j.issn.1673-629X.2016.03.007
求解车辆路径问题的改进MMAS算法
An Improved MMAS for Vehicle Routing Problem
摘要
Abstract
To exploit the best solutions found during an iteration or during the run of the algorithm,Max-Min Ant System ( MMAS) al-lows the ant on the best solution to heighten the pheromone. Unfortunately,it will lead to the premature stagnation of the search. By ana-lyzing the performance of MMAS in Vehicle Routing Problem (VRP),in order to avoid getting a local optimum solution,poor global search optimization ability,and slow convergence rate,a new strategy for pheromone updating is presented. It changes the value of the volatilization coefficients dynamically and updates the pheromones on the best ways,thus accelerating convergence and avoiding prema-ture stagnation. The simulation experiments of the VRP show that the stability and convergence rate of the proposed algorithm is improved significantly compared with the basic MMAS.关键词
车辆路径问题/优化算法/蚁群算法/最大-最小蚂蚁系统/信息素更新Key words
VRP/optimization algorithm/ant colony algorithm/MMAS/pheromone updating分类
信息技术与安全科学引用本文复制引用
谢骊玲,宋彦斌,杨坦,骆其伦..求解车辆路径问题的改进MMAS算法[J].计算机技术与发展,2016,26(3):27-30,35,5.基金项目
国家自然科学基金资助项目(11371154) （11371154）
广东省教育部产学研结合项目(2012B091100186) （2012B091100186）
