.png){kind=icon}
Return
An improved binary particle swarm optimization for unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2008.10.047.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new improved binary PSO (IBPSO) method to solve the unit commitment (UC) problem, which is integrated binary particle swarm optimization (BPSO) with lambda-iteration method. The IBPSO is improved by priority list based on the unit characteristics and heuristic search strategies to repair the spinning reserve and minimum up/down time constraints. To verify the advantages of the IBPSO method, the IBPSO is tested and compared to the other methods on the systems with the number of units in the range of 10-100. Numerical results demonstrate that the IBPSO is Superior to other methods reported in the literature in terms of lower production cost and shorter computational time. (c) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Unit commitment
Priority list
Particle swarm optimization
Heuristic search
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.5
Papers:
2.9W
Citations:
10.2W
Organization
Cited Papers
Cognitive processing of anorexic patients in recognition tasks: An event‐related potentials study
PREAI
ShareSaveShareSavePropiedades de la Utrecht Work Engagement Scale (UWES-S 9): análisis exploratorio con estudiantes en Ecuador.png)
Innovar
OAAI
InnovarIF0
OAAIShareSaveShareSave
View more