Improving the efficiency of -dominance based grids

Authors:
Alfredo G. Hernández-Díaz;Luis V. Santana-Quintero;Carlos A. Coello Coello;Julián Molina;Rafael Caballero
Affiliations:
Department of Economics, Quantitative Methods and Economic History, Pablo de Olavide University, Seville, Spain;Krasnow Institute, George Mason University, Fairfax, VA 22030, USA;CINVESTAV-IPN, Computer Science Department (Evolutionary Computation Group), México D.F., Mexico;Department of Applied Economics (Mathematics), University of Málaga, Málaga, Spain;Department of Applied Economics (Mathematics), University of Málaga, Málaga, Spain
Venue:
Information Sciences: an International Journal
Year:
2011

Citing 20
Cited 1

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Combining convergence and diversity in evolutionary multiobjective optimization

Evolutionary Computation
A Short Tutorial on Evolutionary Multiobjective Optimization

EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
An effective use of crowding distance in multiobjective particle swarm optimization

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy

Evolutionary Computation
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
Evaluating the ε-Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions

Evolutionary Computation
Pareto-adaptive ε-dominance

Evolutionary Computation
Multi-objective genetic algorithms: Problem difficulties and construction of test problems

Evolutionary Computation
DEMORS: A hybrid multi-objective optimization algorithm using differential evolution and rough set theory for constrained problems

Computers and Operations Research
Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Empirical comparison of MOPSO methods: guide selection and diversity preservation

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Multi-objective evolutionary programming without non-domination sorting is up to twenty times faster

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Multi-objective evolutionary algorithms based on the summation of normalized objectives and diversified selection

Information Sciences: an International Journal
A new multi-objective particle swarm optimization algorithm using clustering applied to automated docking

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization

IEEE Transactions on Evolutionary Computation
A review of multiobjective test problems and a scalable test problem toolkit

IEEE Transactions on Evolutionary Computation
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition

IEEE Transactions on Evolutionary Computation

Optimal robust sliding mode tracking control of a biped robot based on ingenious multi-objective PSO

Neurocomputing

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this paper, we deal with the problem of handling solutions in an external archive with the use of a relaxed form of Pareto dominance called @e-dominance and a variation of it called pa@e-dominance. These two relaxed forms of Pareto dominance have been used as archiving strategies in some multi-objective evolutionary algorithms (MOEAs). The main objective of this work is to improve the @e-dominance based schemes to handle nondominated solutions, or to retain nondominated solutions in an external archive. Thus, our main contribution is to add an extra objective function only at the time of accepting a nondominated solution into the external archive, in order to preserve some solutions which are normally lost when using any of the aforementioned relaxed forms of Pareto dominance. Such a proposal is inexpensive (computationally speaking) and quite effective, since it is able to produce Pareto fronts of much better quality than the aforementioned archiving techniques.