, 0000.  C.C. Ribeiro, I. Rosseti, and R. Vallejos. On the use of run time distributions to evaluate and compare stochastic local search algorithms. In T. Sttzle, M. Biratari, and H.H. Hoos, editors, Engineering stochastic local search algorithms, volume 0000 of Lecture Notes in Computer Science, pages 00-00. Springer, Berlin, 0000.  C.C. Ribeiro, I. Rosseti, and R. Vallejos. Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. Journal of Global Optimization, 00:000-000, 0000.MathSciNetCrossRefMATH  L.F. Santos, S.L. Martins, and A. Plastino. Applications of the DM-GRASP heuristic: A survey. International Transactions on Operational Research, 00:000-000, 0000.MathSciNetCrossRefMATH  B. Selman, H.A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 000-000, Seattle, 0000. American Association for Artificial Intelligence.  E.D. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing, 00:000-000, 0000.MathSciNetCrossRef00000-0)  M.G.A. Verhoeven and E.H.L. Aarts. Parallel local search. Journal of Heuristics, 0:00-00, 0000.CrossRefMATH © Springer Science+Business Media New York 0000  Mauricio G.C. Resende and Celso C. RibeiroOptimization by GRASP00.0000/000-0-0000-0000-0_0  # 0. 