On the sensitivity of reactive tabu search to its meta-parameters

Paola Pellegrini (1) , Franco Mascia (2) , Thomas Stutzle (2) , Mauro Birattari (2)

1 IFSTTAR/COSYS/ESTAS - Évaluation des Systèmes de Transports Automatisés et de leur Sécurité
2 IRIDIA - Institut de Recherches interdisciplinaires et de Développements en Intelligence Artificielle [Bruxelles]

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.

Mots clés: INFORMATIQUE; INTELLIGENCE ARTIFICIELLE

Domaines: Intelligence artificielle [cs.AI]

Paola Pellegrini, Franco Mascia, Thomas Stutzle, Mauro Birattari. On the sensitivity of reactive tabu search to its meta-parameters. Soft Computing, 2014, 16p. ⟨10.1007/s00500-013-1192-6⟩. ⟨hal-00990429⟩