By Topic

Relative Velocity Updating in Parallel Particle Swarm Optimization Based Lagrangian Relaxation for Large-scale 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
$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)
Songsak Chusanapiputt ; Department of Electrical Power Engineering, Faculty of Engineering, Mahanakorn University of Technology, Bangkok, Thailand, E-mail: songsak@mut.ac.th ; Dulyatat Nualhong ; Sujate Jantarang ; Sukumvit Phoomvuthisarn

This paper presents an effectiveness of combined parallel relative particle swarm optimization (PRPSO) and Lagrangian relaxation (LR) for a large-scale constrained unit commitment (UC) problem in electric power system. The proposed algorithm incorporates PRPSO with a new relative velocity updating (RVU) approach to tradeoff the solution of each slave processing unit. The parallel algorithm based on the synchronous parallel implementation is developed to consider the neighborhoods decomposition of multiple particle swarm optimizers. The proposed PRPSO divides the neighborhood into sub-neighborhood so that computational effort is reduced and UC solutions are remarkably improved. The proposed method is performed on a test system up to 100 generating units with a scheduling time horizon of 24 hours. The numerical results show an economical saving in the total operating cost when compared to the previous literature results. Moreover, the proposed PRPSO based RVU scheme can considerably speed up the computation time of a traditional PSO, which is favorable for a large-scale UC problem implementation.

Published in:

TENCON 2005 - 2005 IEEE Region 10 Conference

Date of Conference:

21-24 Nov. 2005