International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 96 | Views: 230

Research Paper | Software Engineering | India | Volume 4 Issue 9, September 2015 | Popularity: 6.6 / 10


     

Advance NSGA-II Algorithm for Solving MOO Problems

Ankita Golchha, Shahana Gajala Qureshi


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


Edition: Volume 4 Issue 9, September 2015


Pages: 1689 - 1691



Make Sure to Disable the Pop-Up Blocker of Web Browser




Text copied to Clipboard!
Ankita Golchha, Shahana Gajala Qureshi, "Advance NSGA-II Algorithm for Solving MOO Problems", International Journal of Science and Research (IJSR), Volume 4 Issue 9, September 2015, pp. 1689-1691, https://www.ijsr.net/getabstract.php?paperid=SUB158481, DOI: https://www.doi.org/10.21275/SUB158481