Skip to main content
Book ChapterOPEN ACCESS

Path-relinking

  • Resende M
  • Ribeiro C
Springer New York, (2016), 167-188
DOI: 10.1007/978-1-4939-6530-4_8
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Path-relinking is a search intensification strategy. As a major enhancement to heuristic search methods for solving combinatorial optimization problems, its hybridization with other metaheuristics has led to significant improvements in both solution quality and running times of hybrid heuristics. In this chapter, we review the fundamentals of path-relinking, implementation issues and strategies, and the use of randomization in path-relinking.

Cite

CITATION STYLE

APA

Resende, M. G. C., & Ribeiro, C. C. (2016). Path-relinking. In Optimization by GRASP (pp. 167–188). Springer New York. https://doi.org/10.1007/978-1-4939-6530-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free