On the use of run time distributions to evaluate and compare stochastic local search algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5752 LNCS, Issue , 2009, Pages 16-30

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

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b DEPARTAMENTO DE FÍSICA   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED FORM; COMPUTATION TIME; EXPONENTIAL DISTRIBUTIONS; ITERATIVE PROCEDURES; NEW TOOLS; NUMERICAL EXAMPLE; RUNNING TIME; RUNTIME DISTRIBUTIONS; STOCHASTIC ALGORITHMS; STOCHASTIC LOCAL SEARCHES; TARGET VALUES;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; LEARNING ALGORITHMS;

PROBABILITY DISTRIBUTIONS;

EID: 70350489260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03751-1_2     Document Type: Conference Paper

References (29)

1. Feo, T., Resende, M., Smith, S.: A greedy randomized adaptive search procedure for maximum independent set. Operations Research 42, 860-878 (1994)
2. Hoos, H., Stützle, T.: On the empirical evaluation of Las Vegas algorithms -Position paper. Technical report, Computer Science Department, University of British Columbia (1998)
3. Hoos, 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)
4. Aiex, R., Resende, M., Ribeiro, C.: Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics 8, 343-373 (2002)
5. Dodd, N.: Slow annealing versus multiple fast annealing runs: An empirical investigation. Parallel Computing 16, 269-272 (1990)
6. Eikelder, H.T., Verhoeven, M., Vossen, T., Aarts, E.: A probabilistic analysis of local search. In: Osman, I., Kelly, J. (eds.) Metaheuristics: Theory and Applications, pp. 605-618. Kluwer, Dordrecht (1996)
7. Hoos, H.: On the run-time behaviour of stochastic local search algorithms for SAT. In: Proc. AAAI 1999, pp. 661-666. MIT Press, Cambridge (1999)
8. Hoos, H., Stützle, T.: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence 112, 213-232 (1999)
9. Osborne, L., Gillett, B.: A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing 3, 213-225 (1991)
10. Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the AAAI 1994, pp. 337-343. MIT Press, Cambridge (1994)
11. Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17, 443-455 (1991)
12. Verhoeven, M., Aarts, E.: Parallel local search. Journal of Heuristics 1, 43-66 (1995)
13. Hoos, H., Stützle, T.: Some surprising regularities in the behaviour of stochastic local search. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 470. Springer, Heidelberg (1998)
14. Aiex, R., Resende, M., Ribeiro, C.: TTTPLOTS: A perl program to create timeto-target plots. Optimization Letters 1, 355-366 (2007)
15. Ribeiro, C., Rosseti, I.: Efficient parallel cooperative implementations of GRASP heuristics. Parallel Computing 33, 21-35 (2007)
16. Li, Y., Pardalos, P., Resende, M.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237-261. American Mathematical Society, Providence (1994)
17. Resende, M., Ribeiro, C.: A GRASP for graph planarization. Networks 29, 173-189 (1997)
18. Resende, M., Pitsoulis, L., Pardalos, P.: Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discrete Applied Mathematics 100, 95-113 (2000)
19. Resende, M.: Computing approximate solutions of the maximum covering problem using GRASP. Journal of Heuristics 4, 161-171 (1998)
20. Canuto, S., Resende, M., Ribeiro, C.: Local search with perturbations for the prizecollecting Steiner tree problem in graphs. Networks 38, 50-58 (2001)
21. Resende, M., Ribeiro, 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, Heidelberg (2005)
22. Aiex, R., Pardalos, P., Resende, M., Toraldo, G.: GRASP with path relinking for three-index assignment. INFORMS Journal on Computing 17, 224-247 (2005)
23. Santos, L., Martins, S., Plastino, A.: Applications of the DM-GRASP heuristic: A survey. International Transactions in Operational Research 15, 387-416 (2008)
24. Fonseca, E., Fuchsuber, R., Santos, L., Plastino, A., Martins, S.: Exploring the hybrid metaheuristic DM-GRASP for efficient server replication for reliable multicast. In: International Conference on Metaheuristics and Nature Inspired Computing, Hammamet (2008)
25. Noronha, T., Ribeiro, C.: Routing and wavelength assignment by partition coloring. European Journal of Operational Research 171, 797-810 (2006)
26. Manohar, P., Manjunath, D., Shevgaonkar, R.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Communications Letters 5, 211-213 (2002)
27. Hyytiã, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Nordic Teletraffic Seminar 14, pp. 31-40 (1998)
28. Dahl, G., Johannessen, B.: The 2-path network problem. Networks 43, 190-199 (2004)
29. Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219-249. Kluwer, Dordrecht (2003)