Parallel Greedy Randomized Adaptive Search Procedures

Parallel Metaheuristics: A New Class of Algorithms

Volumn , Issue , 2005, Pages 315-346

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

^a AT AND T LABS RESEARCH   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^d Department of Computer Science ^*  (Brazil)

Author keywords

Job shop scheduling; Multiple walk cooperative thread strategies; Multiple walk independent thread strategies; Parallel grasp implementation; Parallel greedy randomized adaptive search procedures

Indexed keywords

EID: 34948835446     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471739383.ch14     Document Type: Chapter

References (67)

1. R.M. Aiex. Umu investigaçãio experimental du distribuição de probabilidude de tempo de solução em heuristicus GRASP e sua apliação nu análise de implementaçães parulelas. PhD thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, 2002.
2. R.M. Aiex, S. Binato, and M.G.C. Resende. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29: 393-430, 2003.
3. R.M. Aiex and M.G.C. Resende. Parallel strategies for GRASP with pathrelinking. In T. Ibaraki, K. Nonobe, and M. Yagiura, editors, Metaheuristics:Progress us realproblem solvers, pages 301-331. Springer, 2005.
4. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with path relinking for three-index assignment. INFORMS Journal on Computing, 17(2):224-247, 2005.
5. R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro. Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, 81:343-373,2002.
6. A. Alvim and C.C. Ribeiro. Balanceamento de carga na paralelizaqiio da metaheuristica GRASP. In X Simpdsio Brasileiro de Arquiteturas de Computadores, pages 279-282. Sociedade Brasileira de Computaqlo, 1998.
7. A.C.F. Alvim. Estrategias de paralelização da metaheuristica GRASP. Master's thesis, Departamento de Informatica, PUC-Rio, Rio de Janeiro, RJ 22453-900 Brazil, April 1998.
8. E. Balas and M.J. Saltzman. An algorithm for the three-index assignment problem. Oper: Rex, 39: 150-161, 1991.
9. R. Battiti and G. Tecchiolli. Parallel biased search for combinatorial optimization:Genetic algorithms and TABU. Microprocessors and Microsystems, 16: 351-367, 1992.
10. J. E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41: 1069-1072, 1990.
11. S. Binato, H. Faria Jr., and M.G.C. Resende. Greedy randomized adaptive path relinking. In J.P. Sousa, editor, Proceedings of the IV Metaheuristics International Conference, pages 393-397,2001.
12. S. Binato, W.J. Hery, D.M. Loewenstern, and M.G.C. Resende. A GRASP for job shop scheduling. In C.C. Ribeiro and P. Hansen, editors, Essays and Survtys on Metaheuristics, pages 58-79. Kluwer Academic Publishers, 2002.
13. R. Burkard, S. Karisch, and F. Rendl. QAPLIB -A quadratic assignment problem library. European Journal of Operations Research, 55: 115-119, 1991.
14. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks, 38: 50-58, 2001.
15. J. M. Chambers, W. S. Cleveland, B. Kleiner, and P. A. Tukey. Graphical Methods for Data Analysis. Chapman & Hall, 1983.
16. V.-D. Cung, S.L. Martins, C.C. Ribeiro, and C. Roucairol. Strategies for the parallel implementation of metaheuristics. In C.C. Ribeiro and P. Hansen, editors, Essays and sun'eys in metaheuristics, pages 263-308. Kluwer Academic Publishers, 2002.
17. G. Dahl and B. Johannessen. The 2-path network design problem. Networks, 43: 190-199.2004.
18. N. Dodd. Slow annealing versus multiple fast annealing runs: An empirical investigation. Parallel Computing, 16: 269-272, 1990.
19. L.M.A. Drummond, L.S. Vianna, M.B. Silva, and L.S. Ochi. Distributedparallel metaheuristics based on GRASP and VNS for solving the traveling purchaser problem. In Proceedings of the Ninth International Conference on Parallel and Distributed Systems-ICPADS'O2, pages 1-7. IEEE, 2002.
20. S . Duni, P.M. Pardalos, and M.G.C. Resende. Parallel metaheuristics for combinatorial optimization. In R. Corrza, I. Dutra, M. Fiallos, and F. Gomes, editors, Models for Parallel and Distributed Computation-Theory, Algorithmic Techniques and Applications, pages 179-206. Kluwer Academic Publishers, 2002.
21. H.M.M. Ten Eikelder, M.G.A. Verhoeven, T.W.M. Vossen, and E.H.L. Aarts. A probabilistic analysis of local search. In I.H. Osman and J.P. Kelly, editors, Metaheuristics: Theory & applications, pages 605-618. Kluwer Academic Publishers, 1996.
22. H. Faria Jr., S. Binato, M.G.C. Resende, and D.J. Falcfo. Transmission network design by a greedy randomized adaptive path relinking approach. IEEE Transactions on Power Systems, 20(1):43-49,2005.
23. T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8: 67-71, 1989.
24. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6: 109-133, 1995.
25. T.A. Feo, M.G.C. Resende, and S.H. Smith. A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42: 860-878, 1994.
26. P. Festa and M.G.C. Resende. GRASP: An annotated bibliography. In C.C. Ribeiro and P. Hansen, editors, Essays and surveys in metaheuristics, pages 325-367. Kluwer Academic Publishers, 2002.
27. P. Festa and M.G.C. Resende. An annotated bibliography of GRASP. Technical Report TD-SWYSEW, AT&T Labs Research, Florham Park, NJ 07932, February 2004.
28. A.M. Frieze. Complexity of a 3-dimensional assignment problem. European Journal of Operational Research, 13: 161-164, 1983.
29. M.R. Garey and D.S. Johnson. Computers and intractability-A guide to the theov of NP-completeness. W.H. Freeman and Company, 1979.
30. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Mancheck, and V. Sunderam. PVM: Parallel virtual machine, A user S guide and tutorial for networkedparallel computing. Scientific and Engineering Computation. MIT Press, Cambridge, MA, 1994.
31. F. Glover. Tabu search and adaptive memory programing-Advances, applications and challenges. In R.S. Ban; R.V. Helgason, and J.L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1-75. Kluwer, 1996.
32. F. Glover. Multi-start and strategic oscillation methods-Principles to exploit adaptive memory. In M. Laguna and J.L. Gonzales-Velarde, editors, Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pages 1-24. Kluwer, 2000.
33. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
34. F. Glover, M. Laguna, and R. Marti. Fundamentals of scatter search and path relinking. Technical report, Graduate School of Business and Administration, University of Colorado, Boulder, CO 80309-0419,2000.
35. H. Hoos and T. Stützle. Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence, 112: 213-232, 1999.
36. Kendall Square Research. KSR Parallel Programming. 170 Tracer Lane, Waltham, MA, February 1992.
37. M. Laguna and R. Martí. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11 :44-52, 1999.
38. J. K. Lenstra and A. H. G. Rinnooy Kan. Computational complexity of discrete optimization problems. Annals of Discrete Mathematics, 4: 121-140, 1979.
39. Y. Li, P.M. Pardalos, and M.G.C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 237-261. American Mathematical Society, 1994.
40. S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Greedy randomized adaptive search procedures for the Steiner problem in graphs. In P.M. Pardalos, S. Rajasejaran, and J. Rolim, editors, Randomization methods in algorithmic design, volume 43 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 133-145. American Mathematical Society, 1999.
41. S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P.M. Pardalos. A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization, 17: 267-283, 2000.
42. S.L. Martins, C.C. Ribeiro, and I. Rosseti. Applications and parallel implementations of metaheuristics in network design and routing. Lecture Notes in Computer Science, 3285: 205-213, 2004.
43. S.L. Martins, C.C. Ribeiro, and M.C. Souza. A parallel GRASP for the Steiner problem in graphs. In A. Ferreira and J. Rolim, editors, Proceedings of IRREGULAR '98-5th International Symposium on Solving Irregularly Structured Problems in Parallel, volume 1457 of Lecture Notes in Computer Science, pages 285-297. Springer-Verlag, 1998.
44. R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis. A parallel GRASP for the data association multidimensional assignment problem. In P.M. Pardalos, editor, Parallel processing of discrete problems, volume 106 of The IMA Volumes in Mathematics and Its Applications, pages 159-180. Springer-Verlag, 1998.
45. L.J. Osborne and B.E. Gillett. A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing, 3: 213-225, 1991.
46. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A parallel GRASP implementation for the quadratic assignment problem. In A. Ferreira and J. Rolim, editors, Parallel Algorithms for Irregularly Structured Problems-Irregular '94, pages 115-133. Kluwer Academic Publishers, 1995.
47. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A parallel GRASP for MAX-SAT problems. Lecture Notes in Computer Science, 1184:575-585, 1996.
48. W.P. Pierskalla. The tri-subsitution method for the three-multidimensional assignment problem. CORS Journal, 5: 71-81, 1967.
49. M. Prais and C.C. Ribeiro. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12: 164-176, 2000.
50. M.G.C. Resende. Computing approximate solutions of the maximum covering problem using GRASP. J. of Heuristics, 4: 161-171, 1998.
51. M.G.C. Resende, T.A. Feo, and S.H. Smith. Algorithm 787: Fortran subroutines for approximate solution of maximum independent set probiems using GRASP. ACM Trans. Math. Software, 24:386-394, 1998.
52. M.G.C. Resende, P.M. Pardalos, and Y. Li. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, 22: 104-118, 1996.
53. M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discrete Applied Mathematics, 100: 95-113, 2000.
54. M.G.C. Resende and C.C. Ribeiro. A GRASP for graphplanarization. Networks, 29: 173-189, 1997.
55. M.G.C. Resende and C.C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219-249. Kluwer Academic Publishers, 2002.
56. M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for private virtual circuit routing. Networks, 41:104-114,2003.
57. M.G.C. Resende and C.C. Ribeiro. GRASP with path-relidung: Recent advances and applications. In T. Ibaralu, K. Nonobe, and M. Yagiura, editors, Metaheuristics: Progress as realproblem solvers, pages 29-63. Springer, 2005.
58. M.G.C. Resende and R.F. Werneck. A hybrid heuristic for the p-median problem. Journal OfHeuristics, 10: 59-88, 2004.
59. C.C. Ribeiro and M.G.C. Resende. Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Transactions on Mathematical Software, 25: 341-352, 1999.
60. C.C. Ribeiro and I. Rosseti. A parallel GRASP for the 2-path network design problem. Lecture Notes in Computer Science, 2004: 922-926, 2002.
61. C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 14:228-246,2002.
62. I. Rosseti. Heuristicas para o problema de sintese de redes a 2-cuminhos. PhD thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, July 2003.
63. B. Roy and B. Sussmann. Les problémes d'ordonnancement avec contraintes disjonctives, Note D. S. no. 9 bis, SEMA, Paris, France, 1964.
64. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the TweIfth National Conference on ArtiJicial Intelligence, pages 337-343, Seattle, 1994. MIT Press.
65. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra. MPZ-The complete reference, Volume I-The MPI Core. The MIT Press, 1998.
66. E.D. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing, 17: 443-455, 1991.
67. M.G.A. Verhoeven and E.H.L. Aarts. Parallel local search. Journal of Heuristics, 1: 43-46, 1995.