By Topic

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

2 Author(s)
T. Logenthiran ; Department of Electrical and Computer Engineering, National University of Singapore, Singapore ; Dipti Srinivasan

Unit commitment problem is an important optimizing task in daily operational planning of power systems which can be mathematically formulated as a large scale nonlinear mixed-integer minimization problem for which there is no exact solution technique. The solution to the problem can be obtained only by complete enumeration, often at a prohibitively computation time requirement for realistic power systems. In this paper, Particle Swarm Optimization (PSO) based heuristic optimization algorithms have been used to solve the problem. Three versions of PSO algorithms namely, Binary PSO, Improved binary PSO and PSO with Lagrangian relaxation were demonstrated for unit commitment problem. In generally, the benchmark data sets and method have shown that the proposed PSO algorithms are indeed capable of obtaining higher quality solutions efficiently in solving unit commitment problems.

Published in:

Probabilistic Methods Applied to Power Systems (PMAPS), 2010 IEEE 11th International Conference on

Date of Conference:

14-17 June 2010