【24h】

A New Evolutionary Algorithm for Constrained Optimization Problems

机译:约束优化问题的新进化算法

获取原文
获取原文并翻译 | 示例

摘要

In constrained optimization problems,evolutionary algorithms often utilize a penalty function to deal with constraints,which is,however,difficult to control the penalty parameters.To overcome this shortcoming,this paper presents a new constraint handling scheme.Firstly,a new fitness function defined by this penalty function and the objective function is designed.The new fitness function not only can classify all individuals in current population into different layers automatically,but also can distinguish solutions effectively from different layers.Meanwhile,a new crossover operator is also proposed which can produce more high quality individuals.Based on these,a new evolutionary algorithm for constrained optimization problems is proposed The simulations are made on five widely used benchmark problems,and the results indicate the proposed algorithm is effective.
机译:在有约束的优化问题中,进化算法经常利用惩罚函数来处理约束,但是,很难控制惩罚参数。为克服这一缺点,本文提出了一种新的约束处理方案。新的适应度函数不仅可以将当前人口中的所有个体自动分类到不同的层,而且可以有效地区分不同层的解决方案。同时,提出了一种新的交叉算子在此基础上,提出了一种求解约束优化问题的新进化算法。对五个广泛使用的基准问题进行了仿真,结果表明该算法是有效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号