Share Your Research, Maximize Your Social Impacts
Advance NSGA-II Algorithm for Solving MOO Problems
Journal: International Journal of Science and Research (IJSR) (Vol.4, No. 9)Publication Date: 2015-09-05
Authors : Ankita Golchha; Shahana Gajala Qureshi;
Page : 1689-1691
Keywords : NSGA-II; Simulated Binary Crossover; Polynomial mutation; Parent-centric Blend Crossover; Power Mutation;
Source : Download
Find it from : Google Scholar
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.
Other Latest Articles
- Prevalence of Kidney Disorders in Selected Diabetics
- Intelligent Approach for Optimizing Resources in Supply Chain System using RFID
- Antibacterial and Antifungal Activities of Curcuminoid Analogue with Chloro Substituted Phenyl Ring and the Transition Metal Chelates
- The Design of Multi Bit Quantizer Sigma-Delta Modulator Analog to Digital Converter
- An Application of Deterministic and Stochastic Processes to Model Evolving Epidemiology of Tuberculosis in Kenya
Last modified: 2021-06-30 21:53:24