A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling

Authors:
Andrew M. Sutton;Frank Neumann
Affiliations:
School of Computer Science, University of Adelaide, Adelaide, SA, Australia;School of Computer Science, University of Adelaide, Adelaide, SA, Australia
Venue:
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Year:
2012

Citing 11
Cited 1

Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Convergence time to Nash equilibrium in load balancing

ACM Transactions on Algorithms (TALG)
Fixed-parameter evolutionary algorithms and the vertex cover problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Multiplicative drift analysis

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity

Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Theory of Randomized Search Heuristics: Foundations and Recent Developments

Theory of Randomized Search Heuristics: Foundations and Recent Developments
Worst-case and average-case approximations by simple randomized search heuristics

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Parameterized Complexity

Parameterized Complexity

The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider simple multi-start evolutionary algorithms applied to the classical NP-hard combinatorial optimization problem of Makespan Scheduling on two machines. We study the dependence of the runtime of this type of algorithm on three different key hardness parameters. By doing this, we provide further structural insights into the behavior of evolutionary algorithms for this classical problem.