Please use this identifier to cite or link to this item:
|Title:||Modified NSGA-II for day-ahead multi-objective thermal generation scheduling||Authors:||Trivedi, A.
Multi-objective generation scheduling
Non-dominated sorting Genetic Algorithm - II (NSGA-II)
|Issue Date:||2010||Citation:||Trivedi, A.,Pindoriya, N.M.,Srinivasan, D. (2010). Modified NSGA-II for day-ahead multi-objective thermal generation scheduling. 2010 9th International Power and Energy Conference, IPEC 2010 : 752-757. ScholarBank@NUS Repository. https://doi.org/10.1109/IPECON.2010.5697025||Abstract:||In this paper, a novel approach is proposed to solve the day-ahead multi-objective thermal generation scheduling problem. The proposed method combines the principles of Non-dominated Sorting Genetic Algorithm-II (NSGA-II) with problem specific crossover and mutation operators. Heuristics are used in the initial population by seeding the random population with a Priority list based solution for better convergence. The penalty-parameter-less constrained binary tournament method is used as the selection operator to efficiently handle the constraints. Constrain-domination relation is used as the non-dominated classification procedure to classify the population into non-dominated fronts in presence of constraints. Lambda-iteration method is probabilistically used for assigning the economic/environmental real power dispatch to solve the problem. The proposed method is effectively applied to a large scale 60 generating unit power system for short-term generation scheduling problem. It is found that the presented approach gives good convergence to obtain the Pareto-optimal solutions. ©2010 IEEE.||Source Title:||2010 9th International Power and Energy Conference, IPEC 2010||URI:||http://scholarbank.nus.edu.sg/handle/10635/71009||ISBN:||9781424473991||DOI:||10.1109/IPECON.2010.5697025|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 14, 2019
checked on May 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.