Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (10): 96-98.
• 学术探讨 • Previous Articles Next Articles
Received:
Revised:
Online:
Published:
蔡光跃 董恩清
通讯作者:
Abstract: GA (Generation Algorithm) and ACO (Ant Colony Optimization) are two powerful and effective algorithms for solving the combination optimization problems. Recent researches indicate that ACO has high robustness and better ability for searching optimal results. On the base of analysis regarding the two algorithms, their advantages and disadvantages are given by means of large numbers of experiments respectively. Some future research suggestions are provided.
摘要: 遗传算法(Generation Algorithm, GA)和蚁群算法(Ant Colony Optimization, ACO)都是解决组合优化问题的强有力算法。特别是近几年的研究表明,蚁群算法具有极强的鲁棒性和求最优解的能力。本文在分析这两种算法的特点基础上,通过实例验证它们在解决TSP问题上各自的优缺点,并给出做进一步研究的建议。
蔡光跃 董恩清. 遗传算法和蚁群算法在求解TSP问题上的对比分析[J]. 计算机工程与应用, 2007, 43(10): 96-98.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I10/96