Multiobjective evolutionary strategy for finding neighbourhoods of pareto-optimal solutions

Authors:
Ewa Gajda-Zagórska
Affiliations:
AGH University of Science and Technology, Krakow, Poland
Venue:
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
Year:
2013

Citing 7
Cited 0

Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

Proceedings of the 5th International Conference on Genetic Algorithms
Modelling Hierarchical Genetic Strategy as a Family of Markov Chains

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
EA-Powered Basin Number Estimation by Means of Preservation and Exploration

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
A simple and fast algorithm for K-medoids clustering

Expert Systems with Applications: An International Journal
Foundations of Global Genetic Optimization

Foundations of Global Genetic Optimization
Evolutionary multiobjective optimization algorithm as a Markov system

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Pareto set and EMOA behavior for simple multimodal multiobjective functions

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature

Quantified Score

Hi-index	0.00

Visualization

Abstract

In some cases of Multiobjective Optimization problems finding Pareto optimal solutions does not give enough knowledge about the shape of the landscape, especially with multimodal problems and non-connected Pareto fronts. In this paper we present a strategy which combines a hierarchic genetic algorithm consisting of multiple populations with rank selection. This strategy aims at finding neighbourhoods of solutions by recognizing regions with high density of individuals. We compare two variants of the presented strategy on a benchmark two-criteria minimization problem.