Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s00500-013-1192-6 | Soft Computing - A Fusion of Foundations, Methodologies and Applications |
Keywords | Field | DocType |
sensitivity,meta-parameters,maximum clique problem,quadratic assignment problem,reactive tabu search | Hill climbing,Mathematical optimization,Guided Local Search,Computer science,Quadratic assignment problem,Quadratic equation,Robustness (computer science),Artificial intelligence,Machine learning,Tabu search,Clique problem | Journal |
Volume | Issue | ISSN |
18 | 11 | 1433-7479 |
Citations | PageRank | References |
3 | 0.41 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paola Pellegrini | 1 | 66 | 9.25 |
| Franco Mascia | 2 | 96 | 7.24 |
| thomas stutzle | 3 | 5684 | 352.15 |
| Mauro Birattari | 4 | 2021 | 146.61 |