View in EDS HTML Full Text PDF Full Text

Extending the "Open-Closed Principle" to Automated Algorithm Configuration.

Saved in:
Bibliographic Details
Title: Extending the "Open-Closed Principle" to Automated Algorithm Configuration.
Authors: Swan, Jerry1, Adriænsen, Steven2, Barwell, Adam D.3, Hammond, Kevin3, White, David R.4
Source: Evolutionary Computation. Spring2019, Vol. 27 Issue 1, p173-193. 21p.
Subjects: Metaheuristic algorithms, Automatic programming (Computer science), Functional programming (Computer science), Software engineering, Evolutionary computation
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 article, 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. [ABSTRACT FROM AUTHOR]
Copyright of Evolutionary Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 135057797
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Extending the "Open-Closed Principle" to Automated Algorithm Configuration.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Swan%2C+Jerry%22">Swan, Jerry</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Adriænsen%2C+Steven%22">Adriænsen, Steven</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Barwell%2C+Adam+D%2E%22">Barwell, Adam D.</searchLink><relatesTo>3</relatesTo><br /><searchLink fieldCode="AR" term="%22Hammond%2C+Kevin%22">Hammond, Kevin</searchLink><relatesTo>3</relatesTo><br /><searchLink fieldCode="AR" term="%22White%2C+David+R%2E%22">White, David R.</searchLink><relatesTo>4</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Evolutionary+Computation%22">Evolutionary Computation</searchLink>. Spring2019, Vol. 27 Issue 1, p173-193. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Metaheuristic+algorithms%22">Metaheuristic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Automatic+programming+%28Computer+science%29%22">Automatic programming (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Functional+programming+%28Computer+science%29%22">Functional programming (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Software+engineering%22">Software engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Evolutionary+computation%22">Evolutionary computation</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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 article, 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. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Evolutionary Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=135057797
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1162/evco_a_00245
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 173
    Subjects:
      – SubjectFull: Metaheuristic algorithms
        Type: general
      – SubjectFull: Automatic programming (Computer science)
        Type: general
      – SubjectFull: Functional programming (Computer science)
        Type: general
      – SubjectFull: Software engineering
        Type: general
      – SubjectFull: Evolutionary computation
        Type: general
    Titles:
      – TitleFull: Extending the "Open-Closed Principle" to Automated Algorithm Configuration.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Swan, Jerry
      – PersonEntity:
          Name:
            NameFull: Adriænsen, Steven
      – PersonEntity:
          Name:
            NameFull: Barwell, Adam D.
      – PersonEntity:
          Name:
            NameFull: Hammond, Kevin
      – PersonEntity:
          Name:
            NameFull: White, David R.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Spring2019
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-print
              Value: 10636560
          Numbering:
            – Type: volume
              Value: 27
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Evolutionary Computation
              Type: main
ResultId 1