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

Research Paper | Software Engineering | India | Volume 4 Issue 9, September 2015


Advance NSGA-II Algorithm for Solving MOO Problems

Ankita Golchha | Shahana Gajala Qureshi [2]


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


How to Download this Article?

You Need to Register Your Email Address Before You Can Download the Article PDF


How to Cite this Article?

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/get_abstract.php?paper_id=SUB158481

Top