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

一种新的混合策略进化算法
引用本文:时燕,张化祥,赵瑞东.一种新的混合策略进化算法[J].计算机工程与应用,2007,43(13):89-91.
作者姓名:时燕  张化祥  赵瑞东
作者单位:山东师范大学 上海交通大学计算机科学与工程系
基金项目:山西省科技公关计划项目
摘    要:进化计算已成功地运用到各种数值优化和组合优化问题中,而运用单一变异算子的进化算法总是存在着对某种函数优化问题性能良好,对另一些却不尽人意的问题。本文提出一种基于经典进化算法和单点变异算法的混合策略进化算法SPCEP。SPCEP算法利用两种变异算子各产生一个后代个体,并选择较好的一个作为唯一的后代。实验结果表明,在处理高维单模函数时,SPCEP的性能比CEP和SPMEP有显著的提高。

关 键 词:混合策略  经典进化算法  单点变异算法  最优化问题  
文章编号:1002-8331(2007)13-0089-03
收稿时间:2006-5-29
修稿时间:2006-08

A novel mixed-strategy evolutionary programming algorithm
SHI Yan,ZHANG Hua-xiang,ZHAO Rui-dong.A novel mixed-strategy evolutionary programming algorithm[J].Computer Engineering and Applications,2007,43(13):89-91.
Authors:SHI Yan  ZHANG Hua-xiang  ZHAO Rui-dong
Abstract:Evolutionary programming has been applied with success to many numerical and combinatorial optimization problems. But algorithms with one single mutation operator often have the problem that they perform well when deal with these problems, but poor with others.In this paper,we propose an improved evolutionary programming using a mixed strategy based on Gaussion mutation and single-point mutation,which is named SPCEP.In SPCEP,each of the two mutation operators will generate one off- spring.Then a compare will be conducted between them,and the best one will be chosen.Simulation results show that SPCEP is obviously superior to classical CEP and SPMEP for high-dimensional functions.
Keywords:mixed-strategy  Gaussion mutation  single-point mutation  optimization problems
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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