.png){kind=icon}
.png){kind=icon}
Return
Unit commitment by an improved binary quantum GSA
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2017.06.051.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Unit commitment (UC) problem is an important optimizing task for scheduling the on/off states of generating units in power system operation over a time horizon such that the power generation cost is minimized. Since, increasing the number of generating units makes it difficult to solve in practice, many approaches have been introduced to solve the UC problem. This paper introduces an improved version of the binary quantum-inspired gravitational search algorithm (BQIGSA) and proposes a new approach to solve the UC problem based on the improved BQIGSA, called QGSA-UC. The proposed approach is applied to unit commitment problems with the number of generating units in the range of 10120 along with 24-h scheduling horizon and is compared with nine state-of-the-art approaches. Furthermore, four different versions of gravitational approach are implemented for solving the UC problem and compared with those obtained by QGSA-UC. Comparative results clearly reveal the effectiveness of the proposed approach and show that it can be used as a reliable tool to solve UC problem. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Unit commitment problem
Economic dispatch
Quantum computing
Gravitational search algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W