Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/70461
Title: Heuristics-based evolutionary algorithm for solving unit commitment and dispatch
Authors: Srinivasan, D. 
Chazelas, J.
Keywords: Evolutionary algorithm
Power system unit commitment
Priority list heuristics
Issue Date: 2005
Source: Srinivasan, D.,Chazelas, J. (2005). Heuristics-based evolutionary algorithm for solving unit commitment and dispatch. 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings 2 : 1547-1554. ScholarBank@NUS Repository.
Abstract: This paper presents an evolutionary algorithm, guided by heuristics, to solve the unit commitment and dispatch problem in large scale power systems. Unit Commitment is a non linear, large scale, and with a varied set of constraints optimization problem for which there exist no exact solution techniques with a reasonable computation time. Problem-specific heuristics have been included to increase the speed of convergence and the efficiency of the algorithm. The initial random population was seeded with good solutions using a Priority List method, and a problem specific genetic operator was used. A comparison of results with other solution techniques shows superior results, even on large scale systems. © 2005 IEEE.
Source Title: 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
URI: http://scholarbank.nus.edu.sg/handle/10635/70461
ISBN: 0780393635
Appears in Collections:Staff Publications

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

Page view(s)

24
checked on Dec 9, 2017

Google ScholarTM

Check


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