Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization

Ting, Tiew-On and Rao, M.V.C. and Loo, C.K. and Ngu, S.S. (2003) Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization. Journal of Heuristics, 9 (6). pp. 507-520. ISSN 1381-1231

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1023/B:HEUR.0000012449.84567....

Abstract

This paper presents a Hybrid Particle Swarm Optimization (HPSO) to solve the Unit Commitment (UC) problem. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as the minimization of the total objective function while satisfying all the associated constraints. Problem formulation, representation and the simulation results for a 10 generator-scheduling problem are presented. Results shown are acceptable at this early stage.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 22 Aug 2011 06:30
Last Modified: 22 Aug 2011 06:30
URI: http://shdl.mmu.edu.my/id/eprint/2524

Actions (login required)

View Item View Item