计算机与数字工程2011，Vol.39Issue(9)：10-12,3.
基于信息素变异的蚁群算法的应用研究
Application of Ant Colony Algorithm Based on Pheromone Variation
于海平 1杨艳霞1
作者信息
- 1. 武汉科技大学城市学院信息工程学部 武汉430083
- 折叠
摘要
Abstract
Aiming at the phenomena such as searching for a long time and not simulating the real ant, this paper presents a new optimization ant colony algorithm to solve traveling salesman problem. It effectively simulates the real ant for improving the pheromone. As the result, the algorithm effectively improves the search for efficiency. Simulation results of the algorithm to prove the effectiveness and feasibility.关键词
蚁群算法/旅行商问题/信息素/最大最小蚁群算法/变异Key words
ant algorithm/traveling salesman problems/pheromone/MMAS/variation分类
信息技术与安全科学引用本文复制引用
于海平,杨艳霞..基于信息素变异的蚁群算法的应用研究[J].计算机与数字工程,2011,39(9):10-12,3.
