Adaptive Pareto Differential Evolution and Its Parallelization
Lecture notes in computer sciencePublished 1 January 2004
Daniela Zaharie, Dana Petcu
Citations50
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An adaptive Pareto differential evolution algorithm for multi-objective optimization is proposed and its effectiveness on approximating the Pare to front is compared with that of SPEA and of SPDE.
Abstract
An adaptive Pareto differential evolution algorithm for multi-objective optimization is proposed. Its effectiveness on approximating the Pareto front is compared with that of SPEA [9] and of SPDE [2]. A parallel implementation, based on an island model with a random connection topology, is also analyzed. The parallelization efficiency derives from the simple migration strategy. Numerical tests were performed on a cluster of workstations.
Keywords
Computer Science
IEEE Transactions on Evolutionary ComputationA fast and elitist multiobjective genetic algorithm: NSGA-II
47,759 Citations2002Kalyanmoy Deb, Amrit Pratap +2 more
This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Journal of Global OptimizationDifferential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
28,706 Citations1997Rainer Storn, Kenneth V. Price
It is demonstrated that the new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous spacefunctions Converges faster and with more certainty than manyother acclaimed global optimization methods.
Evolutionary ComputationComparison of Multiobjective Evolutionary Algorithms: Empirical Results
5,637 Citations2000Eckart Zitzler, Kalyanmoy Deb +1 more
This paper provides a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions and shows that elitism is shown to be an important factor for improving evolutionary multiobjectives search.
Lecture notes in computer scienceA Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
5,246 Citations2000Kalyanmoy Deb, Samir Agrawal +2 more
Simulation results on five difficult test problems show that the proposed NSGA-II, in most problems, is able to find much better spread of solutions and better convergence near the true Pareto-optimal front compared to PAES and SPEA--two other elitist multi-objective EAs which pay special attention towards creating a diverse Paretimal front.
Repository for Publications and Research Data (ETH Zurich)An evolutionary algorithm for multiobjective optimization: the strength Pareto approach
693 Citations1998Eckart Zitzler, Lothar Thiele
A new evolutionary approach to multicriteria optimization the Strength Pareto Evolutionary Algorithm SPEA is proposed which combines various features of previous multiobjective EAs in a unique manner and is characterized as follows.
PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems
519 Citations2002Hussein A. Abbass, Ruhul Sarker +1 more
The solutions provided by the proposed algorithm for two standard test problems, outperform the Strength Pareto Evolutionary Algorithm, one of the state-of-the-art evolutionary algorithms for solving MOPs.
The self-adaptive Pareto differential evolution algorithm
401 Citations2003Hussein A. Abbass
The emphasis of this paper is to analyze the dynamics and behavior of SPDE, a new version of PDE with self-adaptive crossover and mutation that is very competitive with other EMO algorithms.
Multiobjective optimization using a Pareto differential evolution approach
272 Citations2003Nateri K. Madavan
The differential evolution algorithm is extended to multiobjective optimization problems by using a Pareto-based approach and performs well when applied to several test optimization problems from the literature.
The new model of parallel genetic algorithm in multi-objective optimization problems - divided range multi-objective genetic algorithm
81 Citations2002Tomoyuki Hiroyasu, Mitsunori Miki +1 more
The DRMOGA is a very suitable GA model for parallel processing, and in some cases it can derive better solutions compared to both the single-population model and the distributed model.
PSFGA: a parallel genetic algorithm for multiobjective optimization
56 Citations2003Francisco de Toro, Julio Ortega +2 more
A parallel single front genetic algorithm for multiobjective optimization problems based on an evolutionary procedure where a population of solutions is sorted with respect to the values of the objective functions and partitioned into subpopulations which are distributed among the processors.