Downloads: 96 | Views: 175

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

Rate This Article!

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