Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Journal of Global Optimization

Volumn 54, Issue 2, 2012, Pages 405-429

  Ribeiro, Celso C ^a   Rosseti, Isabel ^a   Vallejos, Reinaldo ^b  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b DEPARTAMENTO DE FÍSICA   (Chile)

Author keywords

GRASP; Metaheuristics; Path relinking; Run time distributions; Stochastic local search; Time to target plots

Indexed keywords

GRASP; META HEURISTICS; PATH RELINKING; RUNTIME DISTRIBUTIONS; STOCHASTIC LOCAL SEARCHES; TIME-TO-TARGET PLOTS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; ITERATIVE METHODS; STOCHASTIC SYSTEMS;

PROBABILITY DISTRIBUTIONS;

EID: 84867265709     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9769-z     Document Type: Conference Paper

References (38)

1. Aiex, R.M., Pardalos, P.M., Resende, M.G.C., Toraldo, G.: GRASP with path relinking for three-index assignment. INFORMS J. Comput. 17, 224-247 (2005)
2. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343-373 (2002)
3. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: a perl program to create time-to-target plots. Optim. Lett. 1, 355-366 (2007)
4. Battiti, R., Tecchiolli, G.: Parallel biased search for combinatorial optimization: genetic algorithms and TABU. Microproces. Microsyst. 16, 351-367 (1992)
5. Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50-58 (2001)
6. Dahl, G., Johannessen, B.: The 2-path network problem. Networks 43, 190-199 (2004)
7. Dodd, N.: Slow annealing versus multiple fast annealing runs: An empirical investigation. Parallel Comput. 16, 269-272 (1990)
8. Ten Eikelder, H.M.M., Verhoeven, M.G.A., Vossen, T.W.M., Aarts, E.H.L. : A probabilistic analysis of local search. In: Osman, I.H., Kelly, J.P. (eds.) Metaheuristics: Theory and Applications, pp. 605-618. Kluwer, Dordrecht, The Netherlands (1996)
9. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109-133 (1995)
10. Feo, T.A., Resende,M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860-878 (1994)
11. Fonseca, E., Fuchsuber, R., Santos, L.F.M., Plastino, A., Martins, S.L.: Exploring the hybrid metaheuristic DM-GRASP for efficient server replication for reliable multicast. In: International Conference on Metaheuristics and Nature Inspired Computing, p. 44. Hammamet (2008)
12. Hoos, H.H.: On the run-time behaviour of stochastic local search algorithms for SAT. In: Proceedings of the AAAI-99, pp. 661-666. MIT Press (1999)
13. Hoos, H.H., Stützle T.: Evaluation of Las Vegas algorithms - pitfalls and remedies. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 238-245 (1998)
14. Hoos, H.H., Stützle, T.: On the empirical evaluation of Las Vegas algorithms - position paper. Technical report, Computer Science Department, University of British Columbia (1998)
15. Hoos, H.H., Stützle, T.: Some surprising regularities in the behaviour of stochastic local search. Lecture Notes in Computer Science 1520, 470 (1998)
16. Hoos, H.H., Stützle, T.: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artif. Intell. 112, 213-232 (1999)
17. Hyytiã, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Nordic Teletraffic Seminar 14, pp. 31-40. (1998)
18. Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems ii: the p-medians. SIAM J. Appl. Math. 37, 513-538 (1979)
19. Li,Y., Pardalos, P.M., Resende,M.G.C.:Agreedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems, vol. 16 ofDIMACS Series on Discrete Mathematics andTheoretical Computer Science, pp. 237-261. American Mathematical Society, Providence (1994)
20. Lucena, A.P., Ribeiro, C.C., Santos, A.C.: A hybrid heuristic for the diameter constrained minimum spanning tree problem. J. Glob. Optim. 46, 363-381 (2010)
21. Manohar, P.,Manjunath, D., Shevgaonkar, R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun. Lett. 5, 211-213 (2002)
22. Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition coloring. Eur. J. Oper. Res. 171, 797-810 (2006)
23. Osborne, L.J., Gillett, B.E.: A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA J. Comput. 3, 213-225 (1991)
24. Resende, M.G.C.: Computing approximate solutions of the maximum covering problem using GRASP. J. Heuristics 4, 161-171 (1998)
25. Resende, M.G.C., Feo, T.A., Smith, S.H.: Algorithm 787: fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Trans. Math. Softw. 24, 386-394 (1998)
26. Resende,M.G.C., Pardalos, P.M., Li, Y.: Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans. Math. Softw. 22, 104-118 (1996)
27. Resende, M.G.C., Pitsoulis, L.S., Pardalos, P.M.: Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discret. Appl. Math. 100, 95-113 (2000)
28. Resende, M.G.C., Ribeiro, C.C.: A GRASP for graph planarization. Networks 29, 173-189 (1997)
29. Resende, M.G.C., Ribeiro, C.C. : GRASP with path-relinking: recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29-63. Springer, Berlin (2005)
30. Resende, M.G.C., Ribeiro, C.C. : Greedy randomized adaptive search procedures: advances and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn, pp. 283-319. Springer, Berlin (2010)
31. Ribeiro, C.C., Resende, M.G.C.: Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans. Math. Softw. 25, 342-352 (1999)
32. Ribeiro, C.C., Rosseti, I.: A parallel GRASP heuristic for the 2-path network design problem. In: Lecture Notes in Computer Science 2400, pp. 922-926 (2002)
33. Ribeiro, C.C., Rosseti, I.: Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput. 33, 21-35 (2007)
34. Ribeiro, C.C., Rosseti, I., Vallejos, R. : On the use of run time distributions to evaluate and compare stochastic local search algorithms. In: Stützle, T., Biratari, M., Hoos, H.H. (eds.) Engineering Stochastic Local Search Algorithms, vol. 5752 of Lecture Notes in Computer Science, pp. 16-30. Springer, Berlin (2009)
35. Santos, L.F., Martins, S.L., Plastino, A.: Applications of the DM-GRASP heuristic: a survey. Int. Trans. Oper. Res. 15, 387-416 (2008)
36. Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the AAAI-94, pp. 337-343. MIT Press (1994)
37. Taillard, E.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443-455 (1991)
38. Verhoeven, M.G.A., Aarts, E.H.L.: Parallel local search. J. Heuristics 1, 43-66 (1995)