.png){kind=icon}
返回
Unit commitment problem with ramp rate constraint using a binary-real-coded genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2013.05.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The unit commitment problem (UCP) is a nonlinear mixed-integer optimization problem, encountered as one of the toughest problems in power systems. The problem becomes even more complicated when dynamic power limit based ramp rate constraint is taken into account. Due to the inadequacy of deterministic methods in handling large-size instances of the UCP, various metaheuristics are being considered as alternative algorithms to realistic power systems, among which genetic algorithm (GA) has been investigated widely since long back. Such proposals have been made for solving only the integer part of the UCP, along with some other approaches for the real part of the problem. Moreover, the ramp rate constraint is usually discussed only in the formulation part, without addressing how it could be implemented in an algorithm. In this paper, the GA is revisited with an attempt to solve both the integer and real parts of the UCP using a single algorithm, as well as to incorporate the ramp rate constraint in the proposed algorithm also. In the computational experiment carried out with power systems up to 100 units over 24-h time horizon, available in the literature, the performance of the proposed GA is found quite satisfactory in comparison with the previously reported results. (C) 2013 Elsevier B. V. All rights reserved.
Keyword:
Unit commitment problem
Ramp rate constraint
Genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
暂无机构信息
引用论文
Cognitive processing of anorexic patients in recognition tasks: An event‐related potentials study
.png){kind=icon}
PREAI
分享收藏
查看更多内容