Advertisement

Parallel Strategies for Grasp with Path-Relinking

  • Renata M. Aiex
  • Mauricio G.C. Resende
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 32)

Abstract

A Greedy Randomized Adaptive Search Procedure (GRASP) is a meta- heuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and a local search. Path-relinking is an intensification strategy that explores trajectories that connect high quality solutions. We analyze two parallel strategies for GRASP with path-relinking and propose a criterion to predict parallel speedup based on experiments with a sequential implementation of the algorithm. Independent and cooperative parallel strategies are described and implemented for the 3-index assignment problem and the job-shop scheduling problem. The computational results for independent parallel strategies are shown to qualitatively behave as predicted by the criterion.

Keywords

Combinatorial optimization job-shop scheduling 3-index assignment local search GRASP path-relinking parallel algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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.Google Scholar
  2. [2]
    R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with path relinking for the three-index assignment problem. Technical report, Information Sciences Research Center, AT&T Labs Research, Florham Park, NJ 07932 USA, 2000. To appear in INFORMS Journal on Computing.Google Scholar
  3. [3]
    R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro. Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, 8:343–373, 2002.CrossRefGoogle Scholar
  4. [4]
    A. Alvim and C.C. Ribeiro. Balanceamento de carga na paralelização da meta-heurística GRASP. In X Simpósio Brasileiro de Arquiteturas de Computadores, pages 279–282. Sociedade Brasileira de Computação, 1998.Google Scholar
  5. [5]
    A.C.F. Alvim. Estratégias de paralelização da metaheurística GRASP. Master’s thesis, Departamento de Informática, PUC-Rio, Rio de Janeiro, RJ 22453-900 Brazil, April 1998.Google Scholar
  6. [6]
    E. Balas and M.J. Saltzman. An algorithm for the three-index assignment problem. Oper. Res., 39:150–161, 1991.MathSciNetGoogle Scholar
  7. [7]
    J. E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41:1069–1072, 1990.Google Scholar
  8. [8]
    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 Surveys on Metaheuristics, pages 58–79. Kluwer Academic Publishers, 2002.Google Scholar
  9. [9]
    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.CrossRefGoogle Scholar
  10. [10]
    J. M. Chambers, W. S. Cleveland, B. Kleiner, and P. A. Tukey. Graphical Methods for Data Analysis. Chapman & Hall, 1983.Google Scholar
  11. [11]
    S. Duni, P.M. Pardalos, and M.G.C. Resende. Parallel metaheuristics for combinatorial optimization. In R. Corrêa, 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.Google Scholar
  12. [12]
    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.CrossRefGoogle Scholar
  13. [13]
    T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133, 1995.CrossRefMathSciNetGoogle Scholar
  14. [14]
    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.Google Scholar
  15. [15]
    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.Google Scholar
  16. [16]
    A.M. Frieze. Complexity of a 3-dimensional assignment problem. European Journal of Operational Research, 13:161–164, 1983.CrossRefGoogle Scholar
  17. [17]
    M.R. Garey and D.S. Johnson. Computers and intractability — A guide to the theory of NP-completeness. W.H. Freeman and Company, 1979.Google Scholar
  18. [18]
    F. Glover. Tabu search and adaptive memory programing — Advances, applications and challenges. In R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1–75. Kluwer, 1996.Google Scholar
  19. [19]
    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.Google Scholar
  20. [20]
    F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.Google Scholar
  21. [21]
    F. Glover, M. Laguna, and R. Martí. Fundamentals of scatter search and path relinking. Technical report, Graduate School of Business and Administration, University of Colorado, Boulder, CO 80309-0419, 2000.Google Scholar
  22. [22]
    M. Laguna and R. Martí. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11:44–52, 1999.Google Scholar
  23. [23]
    J. K. Lenstra and A. H. G. Rinnooy Kan. Computational complexity of discrete optimization problems. Annals of Discrete Mathematics, 4:121–140, 1979.MathSciNetGoogle Scholar
  24. [24]
    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.Google Scholar
  25. [25]
    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.Google Scholar
  26. [26]
    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, pages 267–283, 2000.Google Scholar
  27. [27]
    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 IRREGUALAR’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.Google Scholar
  28. [28]
    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.Google Scholar
  29. [29]
    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.Google Scholar
  30. [30]
    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.Google Scholar
  31. [31]
    W.P. Pierskalla. The tri-subsitution method for the three-multidimensional assignment problem. CORS Journal, 5:71–81, 1967.Google Scholar
  32. [32]
    M.G.C. Resende, T.A. Feo, and S.H. Smith. Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Trans. Math. Software, 24:386–394, 1998.CrossRefGoogle Scholar
  33. [33]
    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.Google Scholar
  34. [34]
    M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for private virtual circuit routing. Networks, 41:104–114, 2003.CrossRefMathSciNetGoogle Scholar
  35. [35]
    M.G.C. Resende and R.F. Werneck. A hybrid multistart heuristic for the uncapacitated facility location problem. Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2003.Google Scholar
  36. [36]
    M.G.C. Resende and R.F. Werneck. A hybrid heuristic for the p-median problem. Journal of Heuristics, 10:59–88, 2004.CrossRefGoogle Scholar
  37. [37]
    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.Google Scholar
  38. [38]
    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.CrossRefMathSciNetGoogle Scholar
  39. [39]
    B. Roy and B. Sussmann. Les problèmes d’ordonnancement avec contraintes disjonctives, 1964.Google Scholar
  40. [40]
    M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra. MPI-The complete reference, Volume 1-The MPI Core. The MIT Press, 1998.Google Scholar
  41. [41]
    E. D. Taillard. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6:108–117, 1994.Google Scholar
  42. [42]
    E.D. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing, 17:443–455, 1991.CrossRefGoogle Scholar
  43. [43]
    M.G.A. Verhoeven and E.H.L. Aarts. Parallel local search. Journal of Heuristics, 1:43–66, 1995.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Renata M. Aiex
    • 1
  • Mauricio G.C. Resende
    • 2
  1. 1.Department of Computer ScienceCatholic University of Rio de JaneiroRio de Janeiro, RJBrazil
  2. 2.Algorithms and Optimization Research DepartmentAT&T Labs ResearchFlorham ParkUSA

Personalised recommendations