A non‐dominance‐based online stopping criterion for multi‐objective evolutionary algorithms
Authors:
- 4 May 2010
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 84 (6) , 661-684
Abstract
A non‐dominance criterion‐based metric that tracks the growth of an archive of non‐dominated solutions over a few generations is proposed to generate a convergence curve for multi‐objective evolutionary algorithms (MOEAs). It was observed that, similar to single‐objective optimization problems, there were significant advances toward the Pareto optimal front in the early phase of evolution while relatively smaller improvements were obtained as the population matured. This convergence curve was used to terminate the MOEA search to obtain a good trade‐off between the computational cost and the quality of the solutions. Two analytical and two crashworthiness optimization problems were used to demonstrate the practical utility of the proposed metric. Copyright © 2010 John Wiley & Sons, Ltd.Keywords
This publication has 30 references indexed in Scilit:
- Statistical Methods for Convergence Detection of Multi-Objective Evolutionary AlgorithmsEvolutionary Computation, 2009
- A general steady state distribution based stopping criteria for finite length genetic algorithmsEuropean Journal of Operational Research, 2007
- A surrogate assisted parallel multiobjective evolutionary algorithm for robust engineering designEngineering Optimization, 2006
- Automotive crashworthiness design using response surface‐based variable screening and optimizationEngineering Computations, 2005
- Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other AlgorithmsIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Self-adaptive mutations may lead to premature convergenceIEEE Transactions on Evolutionary Computation, 2001
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- A multi-objective genetic local search algorithm and its application to flowshop schedulingIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 1998
- A new method to solve generalized multicriteria optimization problems using the simple genetic algorithmStructural and Multidisciplinary Optimization, 1995