Exploring variable neighborhood search for automatic algorithm configuration

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Electronic notes in discrete mathematics Ročník 58; s. 167 - 174
Hlavní autori: Pérez Cáceres, Leslie, Stützle, Thomas
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.04.2017
Predmet:
automatic algorithm configuration
ParamILS
Variable neighborhood search
automatic algorithm configuration
Variable neighborhood search
ParamILS
ISSN:1571-0653, 1571-0653
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2017.03.022