期刊文献+

基于群智能的连续优化算法研究 被引量:3

Research on continuous optimization algorithm based on swarm intelligence
下载PDF
导出
摘要 在对蚁群优化算法(ACO)和粒子群优化算法(PSO)进行分析的基础上,提出一种解决函数连续优化的群智能混合策略——CA-PSO。在求解过程中,首先对解空间进行区域划分,进而利用ACO在优化初期具备的快速收敛性能,在整个解空间内搜索最优解的敏感区域。然后利用蚁群的搜索结果初始化PSO粒子,利用PSO快速和全局收敛性进行所在小区域内的搜索。种群更新时根据蚁群的拓扑结构和小区域间的阶跃规则,蚁群不断向最优解敏感区域聚集,使得敏感区域内粒子数增加,则局部的PSO搜索策略可以更细密的搜索最优。实例结果表明,CA-PSO既能保证解的分布性与多样性,又避免了在多峰值函数寻优过程中陷入局部最优解而停止运算,最终将收敛到全局最优解。 On the basis of the analyses of ant colony optimization (ACO) and particle swarm optimization (PSO), continuous antparticle swarm optimization (CA-PSO) applied in continuous function optimization is proposed. After the space partition is properly employed, ACO is applied to search the sensitive areas through the whole solution space. And then PSO is initialized according to ACO search results and applied to search the optimal solution in every area. After each iteration, swarm renovation is processed following ant-colony topological structure and transfer roles. As a result, the ants gradually assemble in the areas where optimal solution is mostly likely to be. With the number growth of particles in the sensitive areas, local PSO can search more meticulously until find the optimal solution. In conclusion, the CA-PSO can not only ensure the distributing diversity of the solution, but also avoid suboptimal solution when it is applied in the Multimodal function optimization.
出处 《计算机工程与设计》 CSCD 北大核心 2009年第8期1969-1973,共5页 Computer Engineering and Design
基金 国家自然科学基金项目(NO6047200)
关键词 连续优化 蚁群优化算法 粒子群优化算法 群集智能 空间划分 拓扑结构 continuous optimization ant colony optimization (ACO) particle swarm optimization (PSO) swarm-intelligence space partition topological structure
  • 相关文献

参考文献10

二级参考文献105

  • 1王笑蓉,吴铁军.基于Petri网仿真的柔性生产调度——蚁群-遗传递阶进化优化方法[J].浙江大学学报(工学版),2004,38(3):286-291. 被引量:18
  • 2巩敦卫,郝国生,周勇,孙晓燕.分层交互式进化计算及其应用[J].控制与决策,2004,19(10):1117-1120. 被引量:15
  • 3郝国生,巩敦卫,史有群,张勇,刘太湖.基于关系代数的遗传算法模型及其应用[J].东南大学学报(自然科学版),2004,34(B11):58-62. 被引量:4
  • 4郝国生,巩敦卫,史有群,王莉.基于满意域和禁忌域的交互式遗传算法[J].中国矿业大学学报,2005,34(2):204-208. 被引量:14
  • 5[11]Shi Y, Eberhart R. Fuzzy adaptive particle swarm optimization [ A ].Proc. Congress on Evolutionary Computation[ C ]. Seonl, Korea. Piscataway, NJ: IEEE Service Center,27 - 30 May 2001.1.101 - 106.
  • 6[12]Jacques Riget,Jakob S Vesterstrom. A diversity-guided particle swarm optimization-the ARPSO [ DB/OL ]. http://citeseer. nj. nec. com/riget02diversityguided. html.
  • 7[13]Lovbjerg M, Krink T. Extending particle swarms with self-organized criticality[ A ]. Proceedings of the Fourth Congress on evolutionary computation (CEC-2002) [ C ]. Honolulu, HI USA, 2002.2. 1588 -1593.
  • 8[14]Al-kazemi B, Mohan C K. Multi-phase generalization of the particle swarm optimization algorithm[A]. Proceedings of the 2002 Congress on Evolutionary Computation[ C ]. Honolulu, HI USA, 12 - 17 May 2002.1.489 - 494.
  • 9[15]Krink T, Vesterstrom J S, Riget J. Particle swarm optimisation with spatial particle extension[ A]. Proceedings of the Fourth Congress on Evolutionary Computation (CEC-2002) [ C ]. Honolulu, HI USA, 2002.2.1474- 1479.
  • 10[16]Kennedy J, Mendes R. Population structure and particle swarm performance[ A]. Proceedings of the IEEE Congress on Evolutionary Computation ( CEC 2002 ) [ C ]. Honolulu, HI USA, 12 - 17 May 2002.2.1671- 1676.

共引文献211

同被引文献29

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部