Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/70461
DC FieldValue
dc.titleHeuristics-based evolutionary algorithm for solving unit commitment and dispatch
dc.contributor.authorSrinivasan, D.
dc.contributor.authorChazelas, J.
dc.date.accessioned2014-06-19T03:12:24Z
dc.date.available2014-06-19T03:12:24Z
dc.date.issued2005
dc.identifier.citationSrinivasan, 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.
dc.identifier.isbn0780393635
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/70461
dc.description.abstractThis 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.
dc.sourceScopus
dc.subjectEvolutionary algorithm
dc.subjectPower system unit commitment
dc.subjectPriority list heuristics
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitle2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
dc.description.volume2
dc.description.page1547-1554
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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