Non-dominated Rank based Sorting Genetic Algorithms

  • Authors:
  • Ashish Ghosh;Mrinal Kanti Das

  • Affiliations:
  • Machine Intelligence Unit and Center for Soft Computing Research, Indian Statistical Institute 203 B. T. Road, Kolkata 700108, India. E-mail: ash@isical.ac.in;Indian Institute of Science Bangalore, 560 012, India. E-mail: nmrinl@csa.iisc.ernet.in

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper a new concept of ranking among the solutions of the same front, along with elite preservation mechanism and ensuring diversity through the nearest neighbor method is proposed for multi-objective genetic algorithms. This algorithm is applied on a set of benchmark multi-objective test problems and the results are compared with that of NSGA-II (a similar algorithm). The proposed algorithm is seen to over perform the existing algorithm. More specifically, the new approach has been used to solve the deceptive multi-objective optimization problems in a better way.