Abstract
The GRASP method generates several configurations within the search space of a given problem based on which it carries out an improvement phase.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for job shop scheduling. IEEE Transactions on Power Systems 16, 247–253 (2001)
Pitsoulis, L.S., Pardalos, P.M., Hearn, D.W.: Approximate solutions to the turbine balancing problem. European Journal of Operational Research 130(1), 147–155 (2001)
Marinakis, Y., Migdalas, A., Pardalos, P.M.: Expanding neighborhood GRASP for the traveling salesman problem. Computational Optimization and Applications 32(3), 231–257 (2005)
Hashimoto, H., Boussier, S., Vasquez, M., Wilbaut, C.: A GRASP-based approach for technicians and interventions scheduling for telecommunications. Annals of Operations Research 183(1), 143–161 (2011)
Festa, P., Resende, M.: GRASP: An annotated bibliography. In: Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen (eds.), Kluwer Academic, pp. 325–367 (2002)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–134 (1995)
Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C, 2nd edition. Cambridge University Press (1992)
Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Solving large Steiner triple covering problems. Operations Research Letters 39(2), 127–131 (2011)
Azimi, Z.N., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. European Journal of Operational Research 205(2), 290–300 (2010)
Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Annals of Operations Research 98, 2000 (1998)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, vol. 7, pp. 239–240 (1997)
Nebel, B. (ed.): Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, August 4–10, 2001. Morgan Kaufmann (2001)
Dammeyer, F., Voß, S.: Dynamic tabu list management using the reverse elimination method. Annals of Operations Research 41(2), 29–46 (1993)
Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing 29, 393–430 (2002)
Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: GRASP with path relinking for the two-echelon vehicle routing problem. Advances in Metaheuristics, Operations Research/Computer Science Interfaces Series 53, 113–125 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Vasquez, M., Buljubašić, M. (2016). A Two-Phase Iterative Search Procedure: The GRASP Method. In: Siarry, P. (eds) Metaheuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-45403-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-45403-0_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45401-6
Online ISBN: 978-3-319-45403-0
eBook Packages: Computer ScienceComputer Science (R0)