TY - JOUR
T1 - Exploring variable neighborhood search for automatic algorithm configuration
AU - PEREZ CACERES, LESLIE ANGELICA
AU - Stützle, Thomas
PY - 2017/4/1
Y1 - 2017/4/1
N2 - 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.
AB - 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.
KW - automatic algorithm configuration
KW - ParamILS
KW - Variable neighborhood search
UR - http://www.scopus.com/inward/record.url?scp=85017421154&partnerID=8YFLogxK
U2 - 10.1016/j.endm.2017.03.022
DO - 10.1016/j.endm.2017.03.022
M3 - Article
AN - SCOPUS:85017421154
VL - 58
SP - 167
EP - 174
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
SN - 1571-0653
ER -