Skip to content

Research at St Andrews

Extending the ‘Open-Closed Principle’ to automated algorithm configuration

Research output: Contribution to journalArticle

Author(s)

Jerry Swan, Stephen Adriænsen, Adam David Barwell, Kevin Hammond, David White

School/Research organisations

Abstract

Metaheuristics are an effective and diverse class of optimization algorithms: a means of obtaining solutions of acceptable quality for otherwise intractable problems. The selection, construction, and configuration of a metaheuristic for a given problem has historically been a manually intensive process based on experience, experimentation, and reasoning by metaphor. More recently, there has been interest in automating the process of algorithm configuration. In this paper, we identify shared state as an inhibitor of progress for such automation. To solve this problem, we introduce the Automated Open Closed Principle (AOCP), which stipulates design requirements for unintrusive reuse of algorithm frameworks and automated assembly of algorithms from an extensible palette of components. We demonstrate how the AOCP enables a greater degree of automation than previously possible via an example implementation.
Close

Details

Original languageEnglish
JournalEvolutionary Computation
Early online date17 Dec 2018
DOIs
StateE-pub ahead of print - 17 Dec 2018

    Research areas

  • Automated design of algorithms, Automatic programming, Programming by optimization, Metaheuristics, Functional programming, Ant programming, Search based software engineering, Systems self assembly

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. The Missing Link! A new skeleton for evolutionary multi-agent systems in Erlang

    Stypka, J., Turek, W., Byrski, A., Kisiel-Dorohinicki, M., Barwell, A. D., Brown, C. M., Hammond, K. & Janjic, V. Feb 2018 In : International Journal of Parallel Programming. 46, 1, p. 4-22 19 p.

    Research output: Contribution to journalArticle

  2. In search of a map: using program slicing to discover potential parallelism in recursive functions

    Barwell, A. D. & Hammond, K. 7 Sep 2017 Proceedings of the 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing (FHPC 2017). New York: ACM, p. 30-41

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

  3. Towards semi-automatic data-type translation for parallelism in Erlang

    Barwell, A. D., Brown, C. M., Castro, D. & Hammond, K. 23 Sep 2016 Proceedings of the 15th International Workshop on Erlang. New York: ACM, p. 60-61

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

ID: 257273894