求解函数优化问题的混合连续优化算法  

Hybridized continuous ant colony optimization algorithm for solving function optimization problems

作　　者：马卫[1] 朱娴[2] 朱庆保[3] 

机构地区：[1]南京旅游职业学院工程技术系,南京211100 [2]南京理工大学紫金学院计算机系,南京210046 [3]南京师范大学计算机科学与技术学院,南京210097

出　　处：《计算机应用研究》2010年第10期3686-3690,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(60673102);江苏省自然科学基金资助项目(BK2006218)

摘　　要：用蚁群算法进行函数优化时,存在收敛速度慢且易于陷入局部最优解的问题。针对这一现状,提出了一种微粒群和蚂蚁算法相结合的混合连续优化算法,该算法引入微粒群优化操作进行全局搜索牵引,采用网格法进行细密度的蚂蚁局部搜索,从而能很好地应用于求解连续对象优化问题。对若干典型复杂连续函数的实验测试结果表明,该混合算法跳出局部最优解的能力较强,能较快地收敛到全局最优解,并能适于高维空间的优化问题。与最新的有关研究成果相比,该算法不仅寻优精度高,而且收敛速度大幅提高,效果十分令人满意。Such problems as slow convergence and easy falling to the local optimization problems tend to exist in the continuous optimization by means of ant colony algorithm. In order to deal with these problems,this paper presented a new ant colony algorithm which hybridized particle swarm optimization（ PSO） algorithm with ant colony optimization（ ACO） algorithm. It used PSO for global traction,and used grid-based ant colony for precise local search. As a result,the algorithm could well be applied in solving continuous optimization problems. The experimental results obtained on some typical benchmark problems show that the proposed algorithm can not only jump out of the local optimal solution easily,and achieve rapid convergence speed in the global optimal,but also is suitable for the high-dimensional space optimization problem. Compared with the recent relevant research outcome,the algorithm proved satisfying,as high accuracy and quick convergence can be achieved.

关 键 词：函数优化 连续蚁群算法 微粒群算法 混合算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]