GRASP with path-relinking

Mauricio G. C. Resende and Celso C. Ribeiro
Additional contact information
Mauricio G. C. Resende: Amazon.com, Inc., Modeling and Optimization Group (MOP)
Celso C. Ribeiro: Universidade Federal Fluminense, Instituto de Ciência da Computação

Chapter Chapter 9 in Optimization by GRASP, 2016, pp 189-204 from Springer

Abstract: Abstract Path-relinking is a major enhancement to GRASP, adding a long-term memory mechanism to GRASP heuristics. GRASP with path-relinking implements long-term memory using an elite set of diverse high-quality solutions found during the search. In its most basic implementation, at each iteration the path-relinking operator is applied between the solution found at the end of the local search phase and a randomly selected solution from the elite set. The solution resulting from path-relinking is a candidate for inclusion in the elite set. In this chapter we examine elite sets, their integration with GRASP, the basic GRASP with path-relinking procedure, several variants of the basic scheme, including evolutionary path-relinking, and restart strategies for GRASP with path-relinking heuristics.

Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4939-6530-4_9

Ordering information: This item can be ordered from
http://www.springer.com/9781493965304

DOI: 10.1007/978-1-4939-6530-4_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().