Research Output
Optimising an evolutionary algorithm for scheduling
  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.

  • Date:

    31 December 2000

  • Publication Status:

    Published

  • Publisher

    Springer

  • DOI:

    10.1007/3-540-45561-2_30

  • Library of Congress:

    QA76 Computer software

  • Dewey Decimal Classification:

    006 Special Computer Methods

Citation

Urquhart, N. B., Chisholm, K., & Paechter, B. (2000). Optimising an evolutionary algorithm for scheduling. In S. Cagnoni, R. Poli, G. D. Smith, D. Corne, M. Oates, E. Hart, …T. C. Fogarty (Eds.), Real-World Applications of Evolutionary Computing: EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight, Proceedings. , (307-318). https://doi.org/10.1007/3-540-45561-2_30

Authors

Editors

Keywords

Evolutionary algorithm; Scheduling problem; Experimental parameters; meta-EA;

Monthly Views:

Available Documents