期刊文献+

一种新的基于正交实验设计的约束优化进化算法 被引量:52

A Novel Constrained Optimization Evolutionary Algorithm Based on Orthogonal Experimental Design
下载PDF
导出
摘要 提出了一种新的基于正交实验设计的约束优化进化算法.新算法的主要特点是:在搜索机制方面,利用正交实验设计方法安排多个父代个体的交叉操作,提出了一种新的多父体正交交叉算子,新的交叉算子能够有效利用多个父代个体所携带的信息产生新的具有代表性的子代个体.此外,利用单形交叉算子对父代种群进行并行搜索,以协调算法的勘探和开采能力.在约束处理技术上,新算法引入了一个衡量个体优、劣的新比较准则.通过13个标准的测试函数验证了算法的通用性和有效性. A novel constrained optimization evolutionary algorithm based on orthogonal experimental design, referred as COEA/OED, is proposed in this paper for constrained optimization problems. The primary features of the algorithm proposed are as follows. As for search mechanism, COEA/OED utilizes orthogonal experimental design method to arrange the crossover operation of several parents and, as a result, a new multi-patent orthogonal crossover operator is proposed, which can effectively make use of the information carried by the parents and generate representative offspring. In addition, the simplex crossover is used to enrich the exploratory and exploitative abilities of the algorithm proposed. As for constraint-handing technique, a novel individual comparison criterion is introduced. COEA/OED is tested on 13 well-known benchmark functions, and the empirical evidence demonstrates that COEA/OED is generic and effective.
出处 《计算机学报》 EI CSCD 北大核心 2010年第5期855-864,共10页 Chinese Journal of Computers
基金 国家基础研究项目(A14200060159) 国家自然科学基金(60805027 90820302) 教育部博士点基金(200805330005) 湖南省研究生创新基金(CX2009B039)资助~~
关键词 约束优化 进化算法 正交实验设计 约束处理技术 单形交叉算子 constrained optimization evolutionary algorithm orthogonal experimental design constraint-handing techniques simplex crossover
  • 相关文献

参考文献19

  • 1Coello C C A.Theoretical and numerical constraint-handling techniques used with evolutionary algorithms:A survey of the state of the art.Computation Methods in Applied Mechanics and Engineering,2002,191(11-12):1245-1287.
  • 2王勇,蔡自兴,周育人,肖赤心.约束优化进化算法[J].软件学报,2009,20(1):11-29. 被引量:116
  • 3Davis L.Handbook of Genetic Algorithm.New York:van Nostrand,Reinhold,1991.
  • 4Zhang Q F,Leung Y W.Orthogonal genetic algorithm for multimedia multicast routing.IEEE Transactions on Evolutionary Computation,1999,3(1):53-62.
  • 5Leung Y W,Wang Yu-Ping.An orthogonal genetic algorithm with quantization for global numerical optimization.IEEE Transactions on Evolutionary Computation,2001,5(1):41-53.
  • 6Wang Yu-Ping,Dang Chuang-Yin.An evolutionary algorithm for global optimization based on level-set evolution and latin squares.IEEE Transactions on Evolutionary Computation,2007,11(5):579-595.
  • 7张铃,张钹.佳点集遗传算法[J].计算机学报,2001,24(9):917-922. 被引量:165
  • 8Hamida S B,Schoenauer M.ASCHEA:New results using adaptive segregational constraint handling//Proceedings of the Congress on Evolutionary Computation.Piscataway,NJ:IEEE Press,2002:884-889.
  • 9Farmani R,Wright J A.Self-adaptive fitness formulation for constrained optimization.IEEE Transactions on Evolutionary Computation,2003,7(5):445-455.
  • 10Yu J X,Yao X,Choi C,Gou G.Materialized view selection as constrained evolutionary optimization.IEEE Transactions on Systems,Man and Cybernetics(C),2003,33(4):458-467.

二级参考文献30

共引文献340

同被引文献478

引证文献52

二级引证文献292

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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