Running time analysis of evolutionary algorithmson a simplified multiobjective knapsack problem
Natural Computing: an international journal
Quality-time analysis of multi-objective evolutionary algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the effect of populations in evolutionary multi-objective optimization
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids
Information Processing Letters
Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computing minimum cuts by randomized search heuristics
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Approximating covering problems by randomized search heuristics using multi-objective models*
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
An analysis on recombination in multi-objective evolutionary optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
The convergence of a multi-objective evolutionary algorithm based on grids
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Computational complexity analysis of multi-objective genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Runtime analysis of simple interactive evolutionary biobjective optimization algorithms
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Parsimony pressure versus multi-objective optimization for variable length representations
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Advances in evolutionary multi-objective optimization
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Population size matters: rigorous runtime results for maximizing the hypervolume indicator
Proceedings of the 15th annual conference on Genetic and evolutionary computation
An analysis on recombination in multi-objective evolutionary optimization
Artificial Intelligence
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper presents a rigorous running time analysis of evolutionary algorithms on pseudo-Boolean multiobjective optimization problems. We propose and analyze different population-based algorithms, the simple evolutionary multiobjective optimizer (SEMO), and two improved versions, fair evolutionary multiobjective optimizer (FEMO) and greedy evolutionary multiobjective optimizer (GEMO). The analysis is carried out on two biobjective model problems, leading ones trailing zeroes (LOTZ) and count ones count zeroes (COCZ), as well as on the scalable m-objective versions mLOTZ and mCOCZ. Results on the running time of the different population-based algorithms and for an alternative approach, a multistart (1+1)-EA based on the ε-constraint method, are derived. The comparison reveals that for many problems, the simple algorithm SEMO is as efficient as this (1+1)-EA. For some problems, the improved variants FEMO and GEMO are provably better. For the analysis, we propose and apply two general tools, an upper bound technique based on a decision space partition and a randomized graph search algorithm, which facilitate the analysis considerably.