Please use this identifier to cite or link to this item:
|Scopus||Web of Science®|
|Title:||A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling|
|Citation:||Proceedings of 12th International Conference on Parallel Problem Solving from Nature, PPSN XII, held in Taormina, Italy, 1-5 September, 2012: pp.52-61|
|Series/Report no.:||Lecture Notes in Computer Science; 7491|
|Conference Name:||International Conference on Parallel Problem Solving from Nature (12th : 2012 : Taormina, Italy)|
|Andrew M. Sutton and Frank Neumann|
|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.|
|Rights:||© Springer-Verlag Berlin Heidelberg 2012|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.