.png){kind=icon}
返回
An evolutionary programming solution to the unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1109/59.801925.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The present work was conducted with the aim of finding a general method for solving the Unit Commitment (UC) problem. The proposed algorithm employs the Evolutionary Programming (EP) technique in which populations of contending solutions are evolved through random changes, competition, and selection. In the subject algorithm an overall UC schedule is coded as a string of symbols and viewed as a candidate for reproduction Initial populations of such candidates are randomly produced to form the basis of subsequent generations. The practical implementation of this procedure yielded satisfactory results when the EP-based algorithm was tested on a reported UC problem previously addressed by some existing techniques such as Lagrange Relaxation (LR), Dynamic Programming (DP), and Genetic Algorithms (GAs). Numerical results for systems of up to 100 units are given and commented on.
Keyword:
unit commitment
evolutionary programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Post‐stroke depression and functional recovery in a population‐based stroke register. The Finnstroke study基于人群的卒中登记中的卒中后抑郁和功能恢复。Finnstroke研究
.png){kind=icon}
PREAI
分享收藏
Preoperative open field behavior predicts levels of neuropathic pain-related behavior in mice术前旷场行为预测小鼠神经病理性疼痛相关行为水平
PREAI
分享收藏
查看更多内容