We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An Improved Binary Particle Swarm Optimization for Unit Commitment Problem

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
$31 $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

3 Author(s)
Jin Lang ; Liaoning Key Lab. of Manuf. Syst. & Logistics, Northeastern Univ., Shenyang, China ; Lixin Tang ; Zhongwei Zhang

This paper presents an improved binary particle swarm optimization algorithm (IBPSO) to solve short-term thermal unit commitment. Unit commitment (UC) is a challenging optimization problem in the power system operation. The NP-Hardness of the UC motivates us to develop metaheuristics algorithm to solve it approximately. PSO is one of relatively current metaheuristics. When implementing the PSO to UC, we derived two strategies to improve the binary particle swarm optimization algorithm. One is asynchronous time-varying learning strategy and another is a new repairing strategy for particles. In order to verify the performance of the proposed PSO, Lagrangian relaxation is used to find lower bound of UC. A computational experiment is carried out on randomly generated instances. The numerical results show that the IBPSO may obtain better solution within reasonable computational time.

Published in:

Power and Energy Engineering Conference (APPEEC), 2010 Asia-Pacific

Date of Conference:

28-31 March 2010