Exploring variable neighborhood search for automatic algorithm configuration

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Methods for automatic algorithm configuration integrate some search mechanism for generating candidate algorithm configurations and mechanisms for handling the stochasticity of the algorithm configuration problem. One popular algorithm configurator is ParamILS, which searches the configuration space using an iterated local search algorithm. In our research, we explore variable neighborhood search mechanisms as an alternative for the one-exchange neighborhood that is searched in the local search phase of ParamILS. In this article, we explore a reduced variable neighborhood search for automatic configuration. Our experimental results are promising and indicate directions for extending our work.

Original languageEnglish
Pages (from-to)167-174
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume58
DOIs
StatePublished - 1 Apr 2017

Keywords

  • automatic algorithm configuration
  • ParamILS
  • Variable neighborhood search

Fingerprint Dive into the research topics of 'Exploring variable neighborhood search for automatic algorithm configuration'. Together they form a unique fingerprint.

Cite this