期刊文献+

中心引力优化CFO算法研究 被引量:4

Research on Central Force Optimization Algorithm
下载PDF
导出
摘要 中心引力优化算法(Central Force Optimization,CFO)是一种新型的基于天体动力学的多维搜索优化算法.该算法是一种确定性的优化算法,利用一组质子在万有引力作用下的运动,搜索决定空间的最优值,而这组质子按照两个来源于天体力学的迭代方程在空间移动.本文利用天体力学理论对该算法中质子运动方程做了深入的研究,并利用天体力学中万有引力定理对质子运动方程做了推导,建立起天体力学与CFO算法之间的联系,通过天体力学中数学分析的方法对该算法中质子收敛性能进行了分析,最后通过严格的数学推导证明出无论初始时质子是何种分布,CFO算法中所有的质子始终都会收敛于CFO空间的确定最优解.本文结论为了进一步深入研究该算法提供了理论基础. Central Force Optimization (CFO) is a new deterministic multi-dimensional search metaheuristic algorithm based on the metaphor of gravitational kinematics. CFO is a deterministic algorithm that explores a decision space by "flying" a group of "probes" whose trajectories are governed by two simple equations derived from the gravitational metaphor. The paper makes a thor- ough research on the probes move governed by the equations of gravitational motion through the Celestial Mechanics, establishing the relationship between CFO algorithm and Celestial Mechanics and analyzing CFO convergence through mathematics analysis of Celestial Mechanics. Finally, Whatever initial probes distribute, all the probes converge the deterministic result. It provides a theoreti- cal base for further researching.
作者 孟超 孙知信
出处 《电子学报》 EI CAS CSCD 北大核心 2013年第4期698-703,共6页 Acta Electronica Sinica
基金 国家自然科学基金(No.60973140 No.61170276) 江苏省高校自然科学研究重大项目(No.12KJA520003) 江苏省自然科学基金(No.BK2009425)
关键词 质子 中心引力优化 确定性算法 收敛性分析 probe central force optimization deterministic algorithm analyse of convergence
  • 相关文献

参考文献18

  • 1R A Formato. Central force optimization: A new metaheuristic with applications in applied electromagnetics [ J ]. Progress in Electromagnetics Research PIER,2007,77 : 425 - 449.
  • 2S He, et al. Group search optimizer:An optimization algorithm inspired by animal searching behavior[ J]. IEEE Transactions on Evolutionary Computation, 2009,13 (5) : 973 - 990.
  • 3吴晓军,杨战中,赵明.均匀搜索粒子群算法[J].电子学报,2011,39(6):1261-1266. 被引量:55
  • 4Jing Cai, W David Pan. On fast and accttrate block -mo- tion estimation algorithms using particle swarm optimization[J].Information Sciences, 2012,197(15) :53 - 64.
  • 5R F Tavares, et al. An ant colony optimization approach to a pemautational flowshop scheduling problem with out,sourcing al- lowed[ J ]. Computers & Operations Research, 2011,38 ( 9 ) : 1286- 1293.
  • 6苏兆品,蒋建国,梁昌勇,张国富,夏娜.蚁群算法的几乎处处强收敛性分析[J].电子学报,2009,37(8):1646-1650. 被引量:22
  • 7雷秀娟,黄旭,吴爽,郭玲.基于连接强度的PPI网络蚁群优化聚类算法[J].电子学报,2012,40(4):695-702. 被引量:16
  • 8Green II,et al. Training neural networks using central force op- timization and particle swarm optimization: insights and com- parisons[ J ]. Expert Systems with Applications, 2012, 39 ( 1 ): 555 - 563.
  • 9K R Mahmoud. CentTal force optimization: Nelder-Mead hybrid algorithm for rectangular microstrip antenna design[ J]. Electro- magnetics, 2011,31 (8) : 8866 - 8872.
  • 10Ali Haghighi, Helena, et al. Detection of leakage freshwater and friction factor calibration in drinking networks using cen- tral force optimization[ J ]. Water Resoulr Manage, 2012, 26 (8) : 2347 - 2363.

二级参考文献52

共引文献90

同被引文献25

  • 1FORMATO R A. Central force optimization: A new metaheuristic with applications in applied electromagnetics [J]. Progress in Electromagnetics Research-PIER, 2007, 77(1): 425-449.
  • 2ROBERT C G, WANG L F, ALAM M. Training neural networks using central force optimization and particle swarm optimization: insights and comparisons [J]. Expert Systems with Applications, 2012, 39(1): 555-563.
  • 3MAHMOUD K R. Central force optimization: Nelder-Mead hybrid algorithm for rectangular micro strip antenna design [J]. Electromagnetics, 2011, 31(8): 8866-8872.
  • 4ALI H, HELENA M R. Detection of leakage freshwater and friction factor calibration in drinking networks using central force optimization [J]. Water Resource Manage, 2012, 26(8): 2347-2363.
  • 5JING C, DAVID W P. On fast and accurate block-based motion estimation algorithms using particle swarm optimization [J]. Information Sciences, 2012, 197(15): 53-64.
  • 6TAVARES R F N, GODINHO M F. An ant colony optimization approach to a permutational flow shop scheduling problem with outsourcing allowed [J]. Computers & Operations Research, 2011, 38 (9):1286-1293.
  • 7NELDER J A, MEAD R. A simplex method for function minimization [J]. The Computer Journal, 1965, 7(4): 308-313.
  • 8ESMAT R, HOSSEIN N, SAEID S. GSA: A gravitational search algorithm [J]. Information Sciences, 2009, 179(3): 2232-2248.
  • 9刘星宝,蔡自兴,王勇,彭伟雄.应用于高维优化问题的免疫进化算法[J].控制与决策,2011,26(1):59-64. 被引量:4
  • 10吴晓军,杨战中,赵明.均匀搜索粒子群算法[J].电子学报,2011,39(6):1261-1266. 被引量:55

引证文献4

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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