首页> 外文会议>International Middle East Power Systems Conference >Epsilon-dominance based multiobjective genetic algorithm for economic emission load dispatch optimization problem
【24h】

Epsilon-dominance based multiobjective genetic algorithm for economic emission load dispatch optimization problem

机译:基于epsilon-占优势的经济排放载荷派遣优化问题的多目标遗传算法

获取原文

摘要

In this paper, a novel multiobjective genetic algorithm approach for economic emission load dispatch (EELD) optimization problem is presented. TheEELD problem is formulated as a nonlinear constrained multiobjective optimization problem with both equality and inequality constraints. A new optimization algorithm which is based on concept of co-evolution and repair algorithm for handling nonlinear constraints is presented. The algorithm maintains a finite-sized archive of non-dominated solutions which gets iteratively updated in the presence of new solutions based on the concept of ɛ -dominance. The use of ɛ -dominance also makes the algorithms practical by allowing a decision maker to control the resolution of the Pareto set approximation by choosing an appropriate ɛ value. The results demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto-optimal nondominated solutions of the multiobjective EELD problem in one single run. Simulation results with the proposed approach have been compared to those, reported in the literature. The comparison demonstrates the superiority of the proposed approach and confirms its potential to solve the multiobjective EELD problem.
机译:本文介绍了一种新型多目标遗传算法方法,用于经济排放负荷调度(EELD)优化问题。使用平等和不等式约束,将ISELED问题标制作非线性约束多目标优化问题。一种新的优化算法,基于处理非线性约束的协同演化和修复算法的概念。该算法维护了非主导解决方案的有限级别的存档,该解决方案在基于&#x025b的概念的新解决方案的存在下迭代更新; - 群体。使用ɛ - 通过选择合适的&#X025B来控制帕累托设定近似的决议,也使算法实用。价值。结果展示了在单一运行中产生了生成了多目标ELED问题的真实和分布良好的Pareto-Optimal NondoMinate解的能力。仿真结果与所提出的方法相比,与文献中报道的那些相比。比较表明了所提出的方法的优越性,并确认其解决多目标EELD ELEND问题的可能性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号