.png){kind=icon}
Return
A Variable-Dimension Optimization Approach to Unit Commitment Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2009.2038921.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a variable-dimension optimization approach to address the high dimensionality issues in solving the unit commitment problem. This method introduces the concept of adaptive search space dimension. The proposed approach is implemented in particle swarm optimization algorithm. The optimization process starts with an arbitrary problem dimension, adapts with respect to the swarm progress and finally selects the optimal dimensional space. The efficiency of this method is tested on a ten-unit test system. The results are compared with binary programming and fixed duty cycle approaches. The simulation results show that the proposed method results in considerable reduction of problem dimension, faster convergence and improved quality of the final solution.
Keywords:
Evolutionary programming
particle swarm optimization
unit commitment
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
Cognitive processing of anorexic patients in recognition tasks: An event‐related potentials study
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSave
View more