Principled evolutionary algorithm design and the kernel trick

Fergal Lane, R. Muhammad Atif Azad, Conor Ryan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce a new approach to the principled design of evolutionary algorithms (EAs) based on kernel methods. We demonstrate how kernel functions, which capture useful problem domain knowledge, can be used to directly construct EA search operators. We test two kernel search operators on a suite of four challenging combinatorial optimization problem domains. These novel kernel search operators exhibit superior performance to some traditional EA search operators.

Original languageEnglish
Title of host publicationGECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference
EditorsTobias Friedrich
PublisherAssociation for Computing Machinery, Inc
Pages149-150
Number of pages2
ISBN (Electronic)9781450343237
DOIs
Publication statusPublished - 20 Jul 2016
Event2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion - Denver, United States
Duration: 20 Jul 201624 Jul 2016

Publication series

NameGECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference

Conference

Conference2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion
Country/TerritoryUnited States
CityDenver
Period20/07/1624/07/16

Keywords

  • Combinatorial optimization
  • Evolutionary algorithms
  • Kernel methods
  • Search operator design

Fingerprint

Dive into the research topics of 'Principled evolutionary algorithm design and the kernel trick'. Together they form a unique fingerprint.

Cite this