Abstract
This study proposes a novel chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm for solving shortterm hydrothermal scheduling problem with a set of equality and inequality constraints. In the proposed method, chaotic local search technique is employed to enhance the local search capability and convergence rate of the algorithm. In addition, a novel constraint handling strategy is presented to deal with the complicated equality constrains and then ensures the feasibility and effectiveness of solution. A system including four hydro plants coupled hydraulically and three thermal plants has been tested by the proposed algorithm. The results are compared with particle swarm optimization (PSO), quantum-behaved particle swarm optimization (QPSO) and other population-based artificial intelligence algorithms considered. Comparison results reveal that the proposed method can cope with short-term hydrothermal scheduling problem and outperforms other evolutionary methods in the literature.
Author supplied keywords
Cite
CITATION STYLE
Gonggui, C., Shanwai, H., & Zhi, S. (2017). A chaotic quantum behaved particle swarm optimization algorithm for short-term hydrothermal scheduling. Open Electrical and Electronic Engineering Journal, 11, 23–47. https://doi.org/10.2174/1874129001711010023
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.