Please use this identifier to cite or link to this item: https://doi.org/10.1109/CEC.2011.5949883
DC FieldValue
dc.titleImproved multi-objective evolutionary algorithm for day-ahead thermal generation scheduling
dc.contributor.authorTrivedi, A.
dc.contributor.authorPindoriya, N.M.
dc.contributor.authorSrinivasan, D.
dc.contributor.authorSharma, D.
dc.date.accessioned2014-06-19T03:13:28Z
dc.date.available2014-06-19T03:13:28Z
dc.date.issued2011
dc.identifier.citationTrivedi, A.,Pindoriya, N.M.,Srinivasan, D.,Sharma, D. (2011). Improved multi-objective evolutionary algorithm for day-ahead thermal generation scheduling. 2011 IEEE Congress of Evolutionary Computation, CEC 2011 : 2170-2177. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/CEC.2011.5949883" target="_blank">https://doi.org/10.1109/CEC.2011.5949883</a>
dc.identifier.isbn9781424478347
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/70554
dc.description.abstractThis paper presents a multi-objective evolutionary algorithm to solve the day-ahead thermal generation scheduling problem. The objective functions considered to model the scheduling problem are: 1) minimizing the system operation cost and 2) minimizing the emission cost. In the proposed algorithm, the chromosome is formulated as a binary unit commitment matrix (UCM) which stores the generator on/off states and a real power matrix (RPM) which stores the corresponding power dispatch. Problem specific binary genetic operators act on the binary UCM and real genetic operators act on the RPM to effectively explore the large binary and real search spaces separately. Heuristics are used in the initial population by seeding the random population with two Priority list (PL) based solutions for faster convergence. Intelligent repair operator based on PL is designed to repair the solutions for load demand equality constraint violation. The ranking, selection and elitism methods are borrowed from NSGA-II. The proposed algorithm is applied to a large scale 60 generating unit power system and the simulation results are presented and compared with our earlier algorithm [26]. The presented algorithm is found to outperform our earlier algorithm in terms of both convergence and spread in the final Pareto-optimal front. © 2011 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/CEC.2011.5949883
dc.sourceScopus
dc.subjectEvolutionary Algorithm
dc.subjectMulti-objective generation scheduling
dc.subjectUnit Commitment
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/CEC.2011.5949883
dc.description.sourcetitle2011 IEEE Congress of Evolutionary Computation, CEC 2011
dc.description.page2170-2177
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.

SCOPUSTM   
Citations

16
checked on Jun 24, 2019

Page view(s)

46
checked on Jun 21, 2019

Google ScholarTM

Check

Altmetric


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