Title
Optimising an Evolutionary Algorithm for Scheduling
Abstract
This paper examines two techniques for setting the parameters of an evolutionary Algorithm (EA). The example EA used for test purposes undertakes a simple scheduling problem. An initial version of the EA was tested utilising a set of parameters that were decided by basic experimentation. Two subsequent versions were compared with the initial version, the first of these adjusted the parameters at run time, the second used a set of parameters decided on by running a meta-EA. The authors have been able to conclude that the usage of a meta-EA allows an efficient set of parameters to be derived for the problem EA.
Year
DOI
Venue
2000
10.1007/3-540-45561-2_30
EvoWorkshops
Keywords
Field
DocType
efficient set,simple scheduling problem,problem ea,basic experimentation,subsequent version,evolutionary algorithm,test purpose,run time,initial version,scheduling problem
Job shop scheduling,Evolutionary algorithm,Scheduling (computing),Computer science,Artificial intelligence
Conference
ISBN
Citations 
PageRank 
3-540-67353-9
0
0.34
References 
Authors
9
3
Name
Order
Citations
PageRank
neil b urquhart18314.70
Kenneth Chisholm200.34
Ben Paechter351465.78