Abstract
The aim of this paper is to summarize the principles and the applications of the noising methods, a recent family of combinatorial optimization metaheuristics. We describe their commons features and their variants and we give the list of their applications to different combinatorial optimization problems. We also show how the simulated annealing algorithm and the threshold accepting algorithm can be considered as noising methods when the components of the noising methods are properly chosen.
| Original language | English |
|---|---|
| Pages (from-to) | 245-261 |
| Number of pages | 17 |
| Journal | Operations Research/ Computer Science Interfaces Series |
| Volume | 15 |
| DOIs | |
| Publication status | Published - 1 Dec 2002 |