首页> 外文期刊>International journal of electrical and power engineering >Genetic Algorithm with Improved Lambda-Iteration Technique to Solve the Unit Commitment Problem
【24h】

Genetic Algorithm with Improved Lambda-Iteration Technique to Solve the Unit Commitment Problem

机译:改进Lambda迭代技术的遗传算法解决机组组合问题

获取原文
           

摘要

This study presents a two -layer approach to solve the Unit Commitment (UC) problem. The first layer uses a Genetic Algorithm (GA) to decide the on/off status of the units. The second layer uses an Improved Lambda -Iteration (ILI) technique to solve the Economic Dispatch (ED) problem while satisfying all the plant and system constraints. GA`s are general -purpose optimization technique based on principle of natural selection and natural genetics. In order to deal effectively with the constraints involved in the UC problem, a repair and approximate genetic operators were introduced. The proposed method is tested and compared with Lagrangian Relaxation (LR) and GA on the systems with the number of generating units in the range of 10-100. The simulation results reveal that the features of easy implementation, convergence within an acceptable execution time and highly optimal solution in solving UC problem can be achieved.
机译:这项研究提出了一种解决单位承诺(UC)问题的两层方法。第一层使用遗传算法(GA)来确定单元的开/关状态。第二层使用改进的Lambda迭代(ILI)技术来解决经济调度(ED)问题,同时满足所有工厂和系统约束。遗传算法是一种基于自然选择和自然遗传学的通用优化技术。为了有效处理涉及UC问题的约束,引入了一种修复和近似遗传算子。在发电单元数量为10-100的系统上,对提出的方法进行了测试,并与拉格朗日松弛(LR)和GA进行了比较。仿真结果表明,该方法具有易于实现,在可接受的执行时间内收敛,解决UC问题的最佳解决方案等特点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号