Indexed on: 05 Dec '13Published on: 05 Dec '13Published in: Soft Computing
In this paper, we assess the sensitivity of reactive tabu search to its meta-parameters. Based on a thorough experimental analysis of reactive tabu search applications to the quadratic assignment and the maximum clique problem, we show that its performance is relatively insensitive to its meta-parameters. This is particularly evident when compared to the sensitivity of tabu search to its parameters: tabu search is rather penalized if used with sub-optimal parameter settings. Reactive tabu search does not strongly pay its high parameter robustness in terms of performance, although it does not improve the peak performance of tabu search.
Join Sparrho today to stay on top of science
Discover, organise and share research that matters to you