.png){kind=icon}
Return
A Solution to the Unit Commitment Problem Using Imperialistic Competition Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2011.2158010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new approach via a new evolutionary algorithm known as imperialistic competition algorithm (ICA) to solve the unit commitment (UC) problem. In ICA the initial population individuals (countries) are in two types: imperialists and colonies that all together form some empires. Imperialistic competitions among these empires converge to a state in which there exists only one empire. In the proposed ICA for the UC problem, the scheduling variables are coded as integers; therefore, the minimum up/down-time constraints can be handled directly. A new method for initializing the countries is proposed. To verify the performance of the proposed algorithm, it is applied to systems with number of generating units in range of 10 up to 100 in one-day scheduling period.
Keywords:
Generation scheduling
imperialistic competition algorithm
optimization methods
unit commitment problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more