By Topic

A New Quantum-Inspired Binary PSO: Application to Unit Commitment Problems for Power Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yun-Won Jeong ; Department of Electrical Engineering, Konkuk University, Seoul, Korea ; Jong-Bae Park ; Se-Hwan Jang ; Kwang Y. Lee

This paper proposes a new binary particle swarm optimization (BPSO) approach inspired by quantum computing, namely quantum-inspired BPSO (QBPSO). Although BPSO-based approaches have been successfully applied to the combinatorial optimization problems in various fields, the BPSO algorithm has some drawbacks such as premature convergence when handling heavily constrained problems. The proposed QBPSO combines the conventional BPSO with the concept and principles of quantum computing such as a quantum bit and superposition of states. The QBPSO adopts a Q-bit individual for the probabilistic representation, which replaces the velocity update procedure in the particle swarm optimization. To improve the search capability of the quantum computing, this paper also proposes a new rotation gate, that is, a coordinate rotation gate for updating Q-bit individuals combined with a dynamic rotation angle for determining the magnitude of rotation angle. The proposed QBPSO is applied to unit commitment (UC) problems for power systems which are composed of up to 100-units with 24-h demand horizon.

Published in:

IEEE Transactions on Power Systems  (Volume:25 ,  Issue: 3 )