Skip to main content
SpringerLink
Log in

Greedy Randomized Adaptive Search Procedures

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Today, a variety of heuristic approaches are available to the operations research practitioner. One methodology that has a strong intuitive appeal, a prominent empirical track record, and is trivial to efficiently implement on parallel processors is GRASP (Greedy Randomized Adaptive Search Procedures). GRASP is an iterative randomized sampling technique in which each iteration provides a solution to the problem at hand. The incumbent solution over all GRASP iterations is kept as the final result. There are two phases within each GRASP iteration: the first intelligently constructs an initial solution via an adaptive randomized greedy function; the second applies a local search procedure to the constructed solution in hope of finding an improvement. In this paper, we define the various components comprising a GRASP and demonstrate, step by step, how to develop such heuristics for combinatorial optimization problems. Intuitive justifications for the observed empirical behavior of the methodology are discussed. The paper concludes with a brief literature review of GRASP implementations and mentions two industrial applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.F. Bard and T.A. Feo. Operations sequencing in discrete parts manufacturing.Management Science 35: 249–255, 1989.

    Google Scholar 

  2. J.F. Bard and T.A. Feo. An algorithm for the manufacturing equipment selection problem.IIE Transactions 23: 83–92, 1991.

    Google Scholar 

  3. B. Bollobás.Random Graphs. Academic Press, 1985.

  4. R. Burkhard, S. Karisch, and F. Rendl. QAPLIB -A quadratic assignment problem library.European Journal of Operational Research 21, 1991.

  5. R. Carraghan and P.M. Pardalos. An exact algorithm for the maximum clique problem.Operations Research Letters 9, 1990.

  6. S. Chand and H. Schneeberger. Single machine scheduling to minimize earliness subject to no tardy jobs.European Journal of Operational Research 34: 221–230, 1988.

    Google Scholar 

  7. T.A. Feo, J. Bard, and S. Holland. Facility-wide planning and scheduling of printed wiring board assembly. Technical report, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin, Austin, TX 78712-1063, February 1993.

    Google Scholar 

  8. T.A. Feo, J. Bard, and S. Holland. A GRASP for scheduling printed wiring board assembly. Technical report, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin, Austin, TX 78712-1063, December 1993.

    Google Scholar 

  9. T.A. Feo and J.F. Bard. Flight scheduling and maintenance base planning.Management Science 35: 1415–1432, 1989.

    Google Scholar 

  10. T.A. Feo and J.F. Bard. The cutting path and tool selection problem in computer-aided process planning.Journal of Manufacturing Systems 8: 17–26, 1989.

    Google Scholar 

  11. T.A. Feo and J.L. González-Velarde. The intermodal trailer assignment problem. Technical report, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin, Austin, TX 78712-1063, April 1992.

    Google Scholar 

  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.

    Google Scholar 

  13. T.A. Feo, M.G.C. Resende, and S.H. Smith. A greedy randomized adaptive search procedure for a maximum independent set.Operations Research 42: 860–878, 1994.

    Google Scholar 

  14. T.A. Feo, K. Sarathy, and J. McGahan. A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Technical report, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin, Austin, TX 78712-1063, January 1994.

    Google Scholar 

  15. T.A. Feo, K. Venkatraman, and J.F. Bard. A GRASP for a difficult single machine scheduling problem.Computers and Operations Research 1: 8, 1991.

    Google Scholar 

  16. M. Fischetti, S. Martello, and P. Toth. The fixed job scheduling problem with spread-time constraints.Operations Research 35: 849–858, 1987.

    Google Scholar 

  17. C. Friden, A. Hertz, and D. de Werra. Stabulus: A technique for finding stable sets in large graphs with tabu search.Computing 42: 35–44, 1989.

    Google Scholar 

  18. D.R. Fulkerson, G.L. Nemhauser, and L.E. Trotter Jr.. Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems.Mathematical Programming Study 2: 72–81, 1974.

    Google Scholar 

  19. F. Glover. Tabu search—Part I.ORSA Journal on Computing 1: 190–206, 1989.

    Google Scholar 

  20. F. Glover. Tabu search—Part II.ORSA Journal on Computing 2: 4–32, 1990.

    Google Scholar 

  21. D.E Goldberg.Genetic algorithms in search, optimization and machine learning, Addison-Wesley, 1989.

  22. D.S. Johnson and M. Trick, editors.The Second DIMACS Algorithm Implementation Challenge: Maximum Clique, Coloring, and Satisfiability. DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1995.

  23. N.K. Karmarkar and K.G. Ramakrishnan. Computational results of an interior point algorithm for large scale linear programming.Mathematical Programming 52: 555–586, 1991.

    Google Scholar 

  24. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs.Bell System Technical journal 49: 291–307, 1970.

    Google Scholar 

  25. S. Kirkpatrick. Optimization by simulated annealing: Quantitative studies.Journal of Statistical Physics 34: 975–986, 1984.

    Google Scholar 

  26. J.G. Klincewicz. Avoiding local optima in thep-hub location problem using tabu search and GRASP.Annals of Operations Research 40: 283–302, 1992.

    Google Scholar 

  27. J.G. Klincewicz and A. Rajan. Using GRASP to solve the component grouping problem. Technical report, AT&T Bell Laboratories, Holmdel, NJ, 1992. To appear inNaval Research Logistics.

    Google Scholar 

  28. M. Laguna, T.A. Feo, and H.C. Elrod. A greedy randomized adaptive search procedure for the 2-partition problem.Operations Research 42: 677–687, 1994.

    Google Scholar 

  29. M. Laguna and J.L. González-Velarde. A search heuristic for just-in-time scheduling in parallel machines.Journal of Intelligent Manufacturing 2: 253–260, 1991.

    Google Scholar 

  30. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys.The Traveling Salesman Problem. John Wiley, 1985.

  31. 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 ofDIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 237–261. American Mathematical Society, 1994.

  32. C.H. Papadimitriou and K. Steiglitz.Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.

  33. A. Rajan and M. Segal. Assigning components to robotic workcells for electronic assembly.AT&T Technical Journal 68: 93–102, 1989.

    Google Scholar 

  34. M.G.C. Resende and T.A. Feo. A GRASP for Satisfiability. Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1994.

    Google Scholar 

  35. M.G.C. Resende, P.M. Pardalos, and Y. Li. FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP. Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1994.

    Google Scholar 

  36. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard Satisfiability problems.In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pages 440–446, July 1992.

  37. S.H. Smith and T.A. Feo. A GRASP for coloring sparse graphs. Technical report, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin, Austin, TX 78712-1063, January 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Operations Research Group, Department of Mechanical Engineering, The University of Texas, 78712, Austin, TX, USA

    Thomas A. Feo

  2. Mathematical Sciences Research Center, AT&T Bell Laboratories, 07974, Murray Hill, NJ, USA

    Mauricio G. C. Resende

Authors
  1. Thomas A. Feo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feo, T.A., Resende, M.G.C. Greedy Randomized Adaptive Search Procedures. J Glob Optim 6, 109–133 (1995). https://doi.org/10.1007/BF01096763

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01096763

Key words

Search

Navigation