Browse by author
Lookup NU author(s): Dr Thillainathan Logenthiran
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
Author(s): Logenthiran T, Srinivasan D
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: IEEE 11th International Conference on Probabilistic Methods Applied to Power Systems (PMAPS)
Year of Conference: 2010
Pages: 642-647
ISSN: 9781424457205
Publisher: IEEE
URL: http://dx.doi.org/10.1109/PMAPS.2010.5528899
DOI: 10.1109/PMAPS.2010.5528899
