Article ID: | iaor200952643 |
Country: | United States |
Volume: | 20 |
Issue: | 4 |
Start Page Number: | 644 |
End Page Number: | 658 |
Publication Date: | Sep 2008 |
Journal: | INFORMS Journal On Computing |
Authors: | Dorigo Marco, Birattari Mauro, Sttzle Thomas, Balaprakash Prasanna |
Keywords: | combinatorial optimization, programming: travelling salesman |
In recent years, much attention has been devoted to the development of metaheuristics and local search algorithms for tackling stochastic combinatorial optimization problems. This paper focuses on local search algorithms; their effectiveness is greatly determined by the evaluation procedure that is used to select the best of several solutions in the presence of uncertainty. In this paper, we propose an effective evaluation procedure that makes use of