首页 | 官方网站   微博 | 高级检索  
     

自适应中心引力优化算法
引用本文:钱伟懿,张桐桐.自适应中心引力优化算法[J].计算机科学,2012,39(6):207-209.
作者姓名:钱伟懿  张桐桐
作者单位:渤海大学数理学院 锦州 121000
基金项目:国家自然科学基金项目,辽宁省自然科学基金项目
摘    要:针对函数全局优化问题,提出了一种自适应中心引力算法,以平衡全局探测能力和局部搜索能力。首先定义粒子的适应值函数,然后根据与平均适应值的比较,更新粒子运动时间,并引进交叉操作更新当前粒子位置,从而提高算法的收敛速度。最后选择8个典型测试函数进行测试,并与中心引力优化算法和其他粒子群优化算法进行比较。结果表明,该算法得到的结果十分精确,鲁棒性强,优于其他算法。

关 键 词:中心引力优化算法  粒子群算法  自适应  全局优化

Adaptive Central Force Optimization Algorithm
QIAN Wei-yi , ZHANG Tong-tong.Adaptive Central Force Optimization Algorithm[J].Computer Science,2012,39(6):207-209.
Authors:QIAN Wei-yi  ZHANG Tong-tong
Affiliation:(School of Mathematics and Physics,Bohai University,Jinzhou 121000,China)
Abstract:The adaptive central force optimization(ACFO) algorithm was proposed for the global optimization problems in order to balance the abilities of global detective and local search. hhe particles fitness functions was defined. hhe partides movement time was updated based on the fitness value compared with the average fitness value, and the current position was updated by the crossover operation. As a result, the algorithm convergence speed was improved. 8 classic benchmark functions were used to test it Simulation results show that, ACFO is accurate, has strong robustness, compared with several other particle swarm optimization algorithms and CFO algorithms.
Keywords:Central force optimization algorithm  Particle swarm optimization algorithm  Adaptive  Global optimization
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号