A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling

Andrew M. Sutton, Frank Neumann

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationParallel Problem Solving from Nature, PPSN XII - 12th International Conference, Proceedings
Pages52-61
Number of pages10
EditionPART 1
DOIs
StatePublished - Sep 24 2012
Event12th International Conference on Parallel Problem Solving from Nature, PPSN 2012 - Taormina, Italy
Duration: Sep 1 2012Sep 5 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume7491 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Parallel Problem Solving from Nature, PPSN 2012
Country/TerritoryItaly
CityTaormina
Period9/1/129/5/12

Fingerprint

Dive into the research topics of 'A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling'. Together they form a unique fingerprint.

Cite this