Files in this item
Extending the ‘Open-Closed Principle’ to automated algorithm configuration
Item metadata
dc.contributor.author | Swan, Jerry | |
dc.contributor.author | Adriænsen, Stephen | |
dc.contributor.author | Barwell, Adam David | |
dc.contributor.author | Hammond, Kevin | |
dc.contributor.author | White, David | |
dc.date.accessioned | 2019-01-09T10:30:05Z | |
dc.date.available | 2019-01-09T10:30:05Z | |
dc.date.issued | 2019-03-04 | |
dc.identifier | 257273894 | |
dc.identifier | d93c7c7c-e8fb-48e0-8422-dfd513c152df | |
dc.identifier | 85062396776 | |
dc.identifier | 000460193700008 | |
dc.identifier.citation | Swan , J , Adriænsen , S , Barwell , A D , Hammond , K & White , D 2019 , ' Extending the ‘Open-Closed Principle’ to automated algorithm configuration ' , Evolutionary Computation , vol. 27 , no. 1 , pp. 173-193 . https://doi.org/10.1162/evco_a_00245 | en |
dc.identifier.issn | 1063-6560 | |
dc.identifier.other | ORCID: /0000-0002-4326-4562/work/52572461 | |
dc.identifier.other | ORCID: /0000-0003-1236-7160/work/57821937 | |
dc.identifier.uri | https://hdl.handle.net/10023/16809 | |
dc.description.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. | |
dc.format.extent | 21 | |
dc.format.extent | 216373 | |
dc.language.iso | eng | |
dc.relation.ispartof | Evolutionary Computation | en |
dc.subject | Automated design of algorithms | en |
dc.subject | Automatic programming | en |
dc.subject | Programming by optimization | en |
dc.subject | Metaheuristics | en |
dc.subject | Functional programming | en |
dc.subject | Ant programming | en |
dc.subject | Search based software engineering | en |
dc.subject | Systems self assembly | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | QA76 Computer software | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | QA76 | en |
dc.title | Extending the ‘Open-Closed Principle’ to automated algorithm configuration | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1162/evco_a_00245 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | http://eproof.aptaracorp.com/powerproof2/adp.do?aid=7037628478200228772 | en |
dc.identifier.grantnumber | EP/P020631/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.