Advance NSGA-II Algorithm for Solving MOO Problems
Abstract: Non-Dominated Sorting Genetic Algorithm (NSGA-II) is an algorithm known to resolve the Multi-Objective Optimization (MOO) problems. NSGA-II is one of the most extensively used algorithms for solving MOO problems. The present work is projected as expansion to the existing NSGA-II. It this method, different combination of crossover and mutation operator is used and the results are hence shown.
Keywords: NSGA-II, Simulated Binary Crossover, Polynomial mutation, Parent-centric Blend Crossover, Power Mutation
How to Cite?: Ankita Golchha, Shahana Gajala Qureshi, "Advance NSGA-II Algorithm for Solving MOO Problems", Volume 4 Issue 9, September 2015, International Journal of Science and Research (IJSR), Pages: 1689-1691, https://www.ijsr.net/getabstract.php?paperid=SUB158481, DOI: https://dx.doi.org/10.21275/SUB158481