首页> 外文期刊>IEEE Transactions on Power Systems >A solution to the unit-commitment problem using integer-coded genetic algorithm
【24h】

A solution to the unit-commitment problem using integer-coded genetic algorithm

机译:整数编码遗传算法求解机组组合问题

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

This paper presents a new solution to the thermal unit-commitment (UC) problem based on an integer-coded genetic algorithm (GA). The GA chromosome consists of a sequence of alternating sign integer numbers representing the sequence of operation/reservation times of the generating units. The proposed coding achieves significant chromosome size reduction compared to the usual binary coding. As a result, algorithm robustness and execution time are improved. In addition, generating unit minimum up and minimum downtime constraints are directly coded in the chromosome, thus avoiding the use of many penalty functions that usually distort the search space. Test results with systems of up to 100 units and 24-h scheduling horizon are presented.
机译:本文提出了一种基于整数编码遗传算法(GA)的热机组承诺(UC)问题的新解决方案。 GA染色体由一系列交替的符号整数组成,这些整数代表生成单元的操作/保留时间序列。与通常的二进制编码相比,所提出的编码实现了显着的染色体大小减小。结果,提高了算法的鲁棒性和执行时间。另外,将生成单元的最小启动时间和最小停机时间限制直接编码在染色体上,从而避免使用通常会使搜索空间变形的许多惩罚函数。给出了多达100个系统和24小时调度范围的系统的测试结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号