Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics

Volumn 18, Issue 2, 2012, Pages 193-214

  Ribeiro, Celso C ^a   Resende, Mauricio G C ^b  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Hybrid metaheuristics; Metaheuristics; Path relinking; Stochastic local search

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; HEURISTIC SEARCH METHODS; HYBRID METAHEURISTICS; IMPLEMENTATION STRATEGIES; META HEURISTICS; METAHEURISTIC; NUMERICAL EXAMPLE; PATH RELINKING; RUNNING TIME; RUNTIME DISTRIBUTIONS; SCATTER SEARCH; SOLUTION QUALITY; STOCHASTIC LOCAL SEARCHES;

COMBINATORIAL OPTIMIZATION; STOCHASTIC SYSTEMS; TABU SEARCH;

HEURISTIC ALGORITHMS;

EID: 84862228941     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-011-9167-1     Document Type: Review

References (59)

1. Aiex, R.M., Resende, M.G.C.: Parallel strategies for GRASP with path-relinking. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 301-331. Springer, Berlin (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) (Pubitemid 34536965)
3. Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29, 393-430 (2003)
4. 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) (Pubitemid 40891131)
5. 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) (Pubitemid 47519609)
6. Andrade, D.V., Resende, M.G.C.: GRASP with path-relinking for network migration scheduling. In: Proceedings of the International Network Optimization Conference (2007a)
7. Andrade, D.V., Resende, M.G.C.: GRASP with evolutionary path-relinking. Technical report, AT&T Labs Research, Florham Park (2007b)
8. Armentano, V.A., Shiguemoto, A.L., Łokketangen, A.: Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38, 1199-1209 (2010)
9. Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path-relinking for the Steiner problem in graphs. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 39-58. Kluwer Academic, Norwell (2002)
10. 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)
11. Faria Jr., H., Binato, S., Resende, M.G.C., Falcão, D.J.: Transmission network design by a greedy randomized adaptive path relinking approach. IEEE Trans. Power Syst. 20, 43-49 (2005) (Pubitemid 40259418)
12. 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)
13. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP, Part I: Algorithms. Int. Trans. Oper. Res. 16, 1-24 (2009a)
14. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP, Part II: Applications. Int. Trans. Oper. Res. 16, 131-172 (2009b)
15. Festa, P., Pardalos, P.M., Resende,M.G.C., Ribeiro, C.C.: Randomized heuristics for the max-cut problem. Optim. Methods Softw. 6, 1033-1058 (2002)
16. Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C.: GRASP with path-relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics 11, 1-16 (2006)
17. Ghosh, J.B.: Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19, 175-181 (1996) (Pubitemid 126394965)
18. Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sci. 8, 156-166 (1977)
19. Glover, F.: Tabu search and adaptive memory programing-advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1-75. Kluwer Academic, Norwell (1996)
20. Glover, F.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13-54 (1998) (Pubitemid 128044715)
21. Glover, F.: Scatter search and path relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 297-316. McGraw-Hill, New York (1999)
22. Glover, F.: Multi-start and strategic oscillation methods-Principles to exploit adaptive memory. In: Laguna, M., Gonzáles-Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 1-24. Kluwer Academic, Norwell (2000)
23. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Norwell (1997)
24. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653-684 (2000)
25. Glover, F., Laguna,M., Martí, R.: Scatter search. In: Ghosh, A., Tsutsui, S. (eds.) Advances in Evolutionary Computation: Theory and Applications, pp. 519-537. Springer, Berlin (2003)
26. Glover, F., Laguna, M., Martí, R.: Scatter search and path relinking: Foundations and advanced designs. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol. 141, pp. 87-100. Springer, Berlin (2004)
27. Hansen, P., Mladenović, N.: Developments of variable neighborhood search. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 415-439. Kluwer Academic, Norwell (2002)
28. Ho, S.C., Gendreau, M.: Path relinking for the vehicle routing problem. J. Heuristics 12, 55-72 (2006) (Pubitemid 43239507)
29. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, East Lansing (1975)
30. 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)
31. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum, New York (1972)
32. Kincaid, R.K.: Good solutions to discrete noxious location problems via metaheuristics. Ann. Oper. Res. 40, 265-281 (1992)
33. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
34. Laguna, M., Martí, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44-52 (1999)
35. Laguna,M., Martí, R.: Scatter search:Methodology and implementations in C. Operations Research. Computer Science Interfaces Series, Kluwer Academic, Boston (2003)
36. Martí, R.: Feature cluster on scatter search methods for optimization. Eur. J. Oper. Res., 169, 351-698 (2006)
37. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097-1100 (1997)
38. Oliveira, C.A., Pardalos, P.M., Resende,M.G.C.: GRASP with path-relinking for the quadratic assignment problem. Lect. Notes Comput. Sci. 3059, 356-368 (2004)
39. Ranjbar, M., Kianfar, F., Shadrokh, S.: Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl. Math. Comput. 196, 879-888 (2008) (Pubitemid 351174345)
40. Reghioui, M., Prins, C., Labadi, N.: GRASP with path relinking for the capacitated arc routing problem with time windows. Lect. Notes Comp. Sci. 4448, 722-731 (2007) (Pubitemid 47290130)
41. Resende, M.G.C., Ribeiro, C.C., Glover, F., Martí, R.: Scatter search and path-relinking: Fundamentals, advances, and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd. edn., pp. 87-107. Springer, Berlin (2010a)
42. Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219-242. Kluwer Academic, Norwell (2003a)
43. Resende,M.G.C., Ribeiro, C.C.: A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104-114 (2003b)
44. 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)
45. Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures: Advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd edn. Springer, Berlin (2010)
46. Resende, M.G.C., Ribeiro, C.C.: GRASP. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, 2nd edn. Springer, Berlin (2011)
47. Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10, 59-88 (2004)
48. Resende, M.G.C.,Werneck, R.F.: A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174, 54-68 (2006) (Pubitemid 44866840)
49. Resende,M.G.C., Martí, R., Gallego, M., Duarte, A.: GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37, 498-508 (2010b)
50. Ribeiro, C.C., Rosseti, I.: Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput. 33, 21-35 (2007) (Pubitemid 46282132)
51. Ribeiro, C.C., Rosseti, I.: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. In: Proceedings of the VIII Metaheuristics International Conference, Hamburg (2009)
52. Ribeiro, C.C., Vianna, D.S.: A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. In: Anais do II Workshop Brasileiro de Bioinformática, Macaé, pp. 97-102 (2003)
53. Ribeiro, C.C., Vianna, D.S.: A hybrid genetic algorithm for the phylogeny problem using path-relinking as a progressive crossover strategy. Int. Trans. Oper. Res. 16, 641-657 (2009)
54. Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228-246 (2002)
55. Ribeiro, C.C., Rosseti, I., Vallejos, R.: On the use of run time distributions to evaluate and compare stochastic local search algorithms. Lect. Notes Comput. Sci. 5752, 16-30 (2009)
56. Rubinstein, R.Y., Kroese, D.P.: The Cross Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. Springer, Berlin (2004)
57. Scaparra, M., Church, R.: A GRASP and path relinking heuristic for rural road network development. J. Heuristics 11, 89-108 (2005) (Pubitemid 40666381)
58. Vallada, E., Ruiz, R.: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 38, 57-67 (2010)
59. Zhang, G.Q., Lai, K.K.: Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. Eur. J. Oper. Res. 169, 413-425 (2006) (Pubitemid 41375699)