Journal of Computer Applications ›› 2011, Vol. 31 ›› Issue (04): 1084-1089.DOI: 10.3724/SP.J.1087.2011.01084
• Artificial intelligence • Previous Articles Next Articles
Fang-zen GE1,2,Zhen WEI1,Yi-ming TIAN1,Lu-yang LU1
Received:
Revised:
Online:
Published:
Contact:
葛方振1,2,魏臻1,田一鸣1,陆阳1
通讯作者:
作者简介:
基金资助:
Abstract: To resolve the problems of computational complexity and search precision existing in Chaotic Ant Swarm (CAS), a Disturbance CAS (DCAS) algorithm was proposed to significantly improve the performance of the original algorithm. DCAS algorithm reduced computational complexity by a new greedy method of updating ant's best position and a random neighbor selection method. Furthermore, a self-adaptive disturbance strategy was introduced to improve the precision of DCAS by developing ant's local search. Extensive computational studies were also carried out to evaluate the performance of DCAS on a new suite of benchmark functions with up to 1000 dimensions. The results show clearly that the proposed algorithm is effective as well as efficient for the complex high-dimensional optimization problems.
Key words: swarm intelligence, Chaotic Ant Swarm (CAS), global search, high-dimensional optimization problem, function optimization
摘要: 针对新型混沌蚁群优化算法(CAS)求解高维优化问题时存在的计算复杂和搜索精度低问题,提出了扰动混沌蚂蚁群(DCAS)算法。通过建立蚂蚁最佳位置更新贪婪规则和随机邻居选择方法有效地降低了计算复杂度;另外引入自适应扰动策略改进CAS算法,使蚂蚁增强局部搜索能力,提高了原算法的搜索精度。通过一组高维测试函数对DCAS算法的性能进行了高达1000维的仿真实验。测试结果表明,新算法对复杂的高维优化问题可行有效。
关键词: 群智能, 混沌蚁群, 全局搜索, 高维优化问题, 函数优化
CLC Number:
TP18
Fang-zen GE Zhen WEI Yi-ming TIAN Lu-yang LU. High-dimensional optimization problems via disturbance chaotic ant swarm algorithm[J]. Journal of Computer Applications, 2011, 31(04): 1084-1089.
葛方振 魏臻 田一鸣 陆阳. 求解高维优化问题的扰动混沌蚁群优化算法[J]. 计算机应用, 2011, 31(04): 1084-1089.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://www.joca.cn/EN/10.3724/SP.J.1087.2011.01084
http://www.joca.cn/EN/Y2011/V31/I04/1084