Controlled elitist non-dominated sorting genetic algorithms for better convergence

Deb, Kalyanmoy ; Goel, Tushar (2001) Controlled elitist non-dominated sorting genetic algorithms for better convergence Lecture Notes in Computer Science, 1993/2001 . pp. 67-81. ISSN 0302-9743

Full text not available from this repository.

Official URL:

Related URL:


Preserving elitism is found to be an important issue in the study of evolutionary multi-objective optimization (EMO). Although there exists a number of new elitist algorithms, where elitism is introduced in different ways, the extent of elitism is likely to be an important matter. The desired extent of elitism is directly related to the so-called exploitation-exploration issue of an evolutionary algorithm (EA). For a particular recombination and mutation operators, there may exist a selection operator with a particular extent of elitism that will cause a smooth working of an EA. In this paper, we suggest an approach where the extent of elitism can be controlled by fixing a user-defined parameter. By applying an elitist multi-objective EA (NSGA-II) to a number of diffcult test problems, we show that the NSGA-II with controlled elitism has much better convergence property than the original NSGA-II. The need for a controlled elitism in evolutionary multi-objective optimization, demonstrated in this paper should encourage similar or other ways of implementing controlled elitism in other multi-objective evolutionary algorithms.

Item Type:Article
Source:Copyright of this article belongs to Springer.
ID Code:83518
Deposited On:21 Feb 2012 07:09
Last Modified:21 Feb 2012 07:09

Repository Staff Only: item control page