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

结合非固定多段罚函数的约束优化进化算法
引用本文:邹木春.结合非固定多段罚函数的约束优化进化算法[J].计算机工程,2012,38(12):165-168.
作者姓名:邹木春
作者单位:宜春学院数学与计算机学院,江西宜春,336000
摘    要:利用非固定多段映射罚函数的约束条件,提出一种结合非固定多段罚函数的约束优化进化算法。该算法利用佳点集方法初始化种群,以保证其均匀分布在搜索空间中。在进化过程中,对种群进行单形交叉和多样性变异操作产生新的个体,增加种群的多样性。对6个经典Benchmark问题进行测试,实验结果表明,该算法能有效地处理不同的约束优化问题。

关 键 词:约束优化问题  进化算法  非固定多段罚函数  单形交叉  变异  佳点集
收稿时间:2011-08-08

Constrained Optimization Evolutionary Algorithm Combining Non-stationary Multi-stage Penalty Function
ZOU Mu-chun.Constrained Optimization Evolutionary Algorithm Combining Non-stationary Multi-stage Penalty Function[J].Computer Engineering,2012,38(12):165-168.
Authors:ZOU Mu-chun
Affiliation:ZOU Mu-chun(School of Mathematics and Computer,Yichun College,Yichun 336000,China)
Abstract:Using non-stationary multi-stage assignment penalty function to deal with the constrained conditions,a modified constrained optimization evolutionary algorithm is proposed.In the process of evolution,in order to ensure the population evenly distributed in the search space,the individuals generation based on good point set method is introduced into the evolutionary algorithm initial step.The offspring population individuals are generated by simplex crossover and diversity mutation operator to maintain the diversity of population.Six classic Benchmark problems are tested.Experimental results show that the proposed algorithm is an effective way for constrained optimization problems.
Keywords:constrained optimization problem  evolutionary algorithm  non-stationary multi-stage penalty function  simplex crossover  mutation  good point set
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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