计算机工程与应用2011，Vol.47Issue(9)：41-44,47,5.DOI:10.3778/j.issn.1002-8331.2011.09.011
MMAS-EC算法求解旅行商问题
MMAS-EC algorithm for solving traveling salesman problem.
李哲 1夏立 1庄浩俊 2董红生3
作者信息
- 1. 海军工程大学电气与信息工程学院,武汉,430033
- 2. 中国人民解放军,91656部队
- 3. 中国人民解放军,92665部队
- 折叠
摘要
Abstract
One of the problems encountered when ant colony optimization is applied to traveling salesman problem is that sometimes this algorithm results in a lower performance.According to this problem, a new Max-Min Ant System combining with Ejection Chains is presented(MMAS-EC).A new strategy based on global search and neighborhood search is used in this algorithm. Firstly, Max-Min Ant System which performs effectively in ant colony optimization is used to guide the global search. Then Ejection Chains(EC) is introduced to exploit the neighborhood space. Because the results generated by ejection chains depend on their original state,2-opt operation is adopted,which can help avoid instability of results.Theorems and simulations show that the new MMAS-EC outperforms traditional MMAS algorithm with less time increased in all the instances.关键词
蚁群优化算法/旅行商问题/排出算法/最大-最小蚁群系统Key words
ant colony optimization/Traveling Salesman Problem(TSP)/ejection chains/max-min ant system分类
信息技术与安全科学引用本文复制引用
李哲,夏立,庄浩俊,董红生..MMAS-EC算法求解旅行商问题[J].计算机工程与应用,2011,47(9):41-44,47,5.
