Please use this identifier to cite or link to this item: https://doi.org/10.1109/PMAPS.2010.5528899
Title: Particle Swarm Optimization for unit commitment problem
Authors: Logenthiran, T.
Srinivasan, D. 
Keywords: Lagrangian relaxation
Optimizing power system operation
Particle swarm optimization
Unit commitment
Issue Date: 2010
Source: Logenthiran, T.,Srinivasan, D. (2010). Particle Swarm Optimization for unit commitment problem. 2010 IEEE 11th International Conference on Probabilistic Methods Applied to Power Systems, PMAPS 2010 : 642-647. ScholarBank@NUS Repository. https://doi.org/10.1109/PMAPS.2010.5528899
Abstract: 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. © 2010 IEEE.
Source Title: 2010 IEEE 11th International Conference on Probabilistic Methods Applied to Power Systems, PMAPS 2010
URI: http://scholarbank.nus.edu.sg/handle/10635/71371
ISBN: 9781424457236
DOI: 10.1109/PMAPS.2010.5528899
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

23
checked on Dec 11, 2017

Page view(s)

27
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.