Drift analysis and average time complexity of evolutionary algorithms
Artificial Intelligence
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Running time analysis of evolutionary algorithmson a simplified multiobjective knapsack problem
Natural Computing: an international journal
Multicriteria Optimization
On the effect of populations in evolutionary multi-objective optimization
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Minimum spanning trees made easier via multi-objective optimization
Natural Computing: an international journal
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Do additional objectives make a problem harder?
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions
IEEE Transactions on Evolutionary Computation
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Analyzing Hypervolume Indicator Based Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Some comments on GD and IGD and relations to the Hausdorff distance
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
On the effect of populations in evolutionary multi-objective optimisation**
Evolutionary Computation
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Illustration of fairness in evolutionary multi-objective optimization
Theoretical Computer Science
Information Sciences: an International Journal
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Information Sciences: an International Journal
Hi-index | 0.00 |
Using diversity mechanisms in evolutionary algorithms for multi-objective optimization problems is considered as an important issue for the design of successful algorithms. This is in particular the case for problems where the number of non-dominated feasible objective vectors is exponential with respect to the problem size. In this case the goal is to compute a good approximation of the Pareto front. We investigate how this goal can be achieved by using the diversity mechanism of epsilon-dominance and point out where this concept is provably helpful to obtain a good approximation of an exponentially large Pareto front in expected polynomial time. Afterwards, we consider the drawbacks of this approach and point out situations where the use of epsilon-dominance slows down the optimization process significantly.