Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/69305
Title: An efficient multi-objective evolutionary algorithm with steady-state replacement model
Authors: Srinivasan, D. 
Rachmawati, L.
Keywords: Genetic algorithms
Multi-objective optimization
Issue Date: 2006
Source: Srinivasan, D.,Rachmawati, L. (2006). An efficient multi-objective evolutionary algorithm with steady-state replacement model. GECCO 2006 - Genetic and Evolutionary Computation Conference 1 : 715-722. ScholarBank@NUS Repository.
Abstract: The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most multi-objective evolutionary algorithms today employ Pareto-ranking as the main criteria for fitness calculation. The computation of Pareto-rank in a population is time consuming, and arguably the most computationally expensive component in an iteration of the said algorithms. This paper proposes a Multiobjective Evolutionary Algorithm which avoids Pareto-ranking altogether by employing the transitivity of the domination relation. The proposed algorithm is an elitist algorithm with explicit diversity preservation procedure. It applies a measure reflecting the degree of domination between solutions in a steady-state replacement strategy to determine which individuals survive to the next iteration. Results on nine standard test functions demonstrated that the algorithm performs favorably compared to the popular NSGA-II in terms of convergence as well as diversity of the Pareto-set approximation, and is computationally more efficient. Copyright 2006 ACM.
Source Title: GECCO 2006 - Genetic and Evolutionary Computation Conference
URI: http://scholarbank.nus.edu.sg/handle/10635/69305
ISBN: 1595931864
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

33
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.