Advertisement

Greedy Randomized Adaptive Search Procedures

  • Abraham Duarte
  • Manuel Laguna
  • Rafael Martí
Chapter
Part of the EURO Advanced Tutorials on Operational Research book series (EUROATOR)

Abstract

In this chapter, we describe the process of designing heuristic procedures to solve combinatorial optimization problems.

References

  1. 1.
    Duarte, A., and R. Martí. 2007. Tabu search and GRASP for the maximum diversity problem. European Journal of Operational Research 178: 7184.CrossRefGoogle Scholar
  2. 2.
    Feo, T.A., and M.G.C. Resende. 1989. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8: 6771.CrossRefGoogle Scholar
  3. 3.
    Feo, T.A., and M.G.C. Resende. 1995. Greedy randomized adaptive search procedures. Journal of Global Optimization 6: 109133.CrossRefGoogle Scholar
  4. 4.
    Kiong, L.V. 2010. Excel VBA made easy: A concise guide for beginners. Paramount CA: Createspace.Google Scholar
  5. 5.
    Martí, R., M. Gallego, A. Duarte, and E.G. Pardo. 2013. Heuristics and metaheuristics for the maximum diversity problem. Journal of Heuristics 19 (4): 591–615.CrossRefGoogle Scholar
  6. 6.
    Prokopyev, O.A., N. Kong, and D.L. Martinez-Torres. 2009. The equitable dispersion problem. European Journal of Operational Research 197: 59–67.CrossRefGoogle Scholar
  7. 7.
    Resende, M.G.C., and C.C. Ribeiro. 2014. GRASP: Greedy randomized adaptive search procedures. In Search methodologies, eds. Burke, E.K., Kendall, G, 287–312. US: SpringerGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.E.T.S. Ingeniería InformáticaUniversidad Rey Juan CarlosMadridSpain
  2. 2.Leeds School of BusinessBoulderUSA
  3. 3.Universidad de ValenciaBurjassot, ValenciaSpain

Personalised recommendations