首页 | 本学科首页   官方微博 | 高级检索  
     

一种新的求解函数优化问题的快速演化算法
引用本文:刘小波,蔡之华,龚文引.一种新的求解函数优化问题的快速演化算法[J].计算机测量与控制,2007,15(5):654-656,659.
作者姓名:刘小波  蔡之华  龚文引
作者单位:中国地质大学,计算机学院,湖北,武汉,430074
基金项目:民用航天科技项目 , 湖北省人文社会科学研究基地开放基金 , 湖北省自然科学基金
摘    要:提出一种新的求解函数优化的快速演化算法;新算法的特征是引入一种基于高斯变异和Cauchy变异的混合自适应变异算子,并作为算法的唯一遗传算子;提出多父体变异的群体爬山搜索策略;采用随机排序选择策略,克服了经典算法易于陷入局部最优解的常见弊病;新算法具有保持群体的多样性、全概率收敛、淘汰压力小、子空间搜索、快速收敛、评价次数少等特性;通过7个标准测试函数测试结果表明,新算法在所有的测试函数中体现出很好的性能,具有稳定、高效和快速等特点.

关 键 词:演化算法  函数优化  混合变异  随机排序  解函数  优化问题  快速收敛  演化算法  Problems  Function  Optimization  Evolutionary  Algorithm  Fast  稳定  性能  测试结果  测试函数  标准  特性  评价  子空间搜索  压力  概率收敛  常见弊病  最优解
文章编号:1671-4598(2007)05-0654-03
收稿时间:2006-07-16
修稿时间:2006-07-162006-08-27

Novel and Fast Evolutionary Algorithm for Function Optimization Problems
Liu Xiaobo,Cai Zhihua,Gong Wenyin.Novel and Fast Evolutionary Algorithm for Function Optimization Problems[J].Computer Measurement & Control,2007,15(5):654-656,659.
Authors:Liu Xiaobo  Cai Zhihua  Gong Wenyin
Affiliation:School of Computer Sciences, China University of Geosciences, Wuhan 430074, China
Abstract:A novel and fast evolutionary algorithm(NFEA) for function optimization problems is proposed.It has some new features,such as introducing a hybrid mutation operator based on Gaussian mutation and Cauchy mutation,using multi-parent mutation's colony mountain climbing search strategy and stochastic ranking strategy,which conquered the shortcomings where classic algorithms are easy to fall into the local optimum.The characteristics of the proposed algorithm include to keep the variety of colony,one probability convergence.And the selection pressure is small.Moreover,the number of function evaluations are also less than other compared algorithms.The new algorithm is tested on 7 benchmark functions,the results indicate that the new algorithm is stable,effective and fast;and it can solve all of the tested functions very well.
Keywords:evolutionary algorithm  function optimization  hybrid mutation  stochastic ranking
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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