Optimization Online


Path-relinking intensification methods for stochastic local search algorithms

Celso C. Ribeiro (celso***at***ic.uff.br)
Mauricio G. C. Resende (mgcr***at***research.att.com)

Abstract: Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions.

Keywords: Path-relinking, metaheuristics, hybrid metaheurisics.

Category 1: Combinatorial Optimization (Meta Heuristics )

Citation: AT&T Labs Research Technical Report, Florham Park, NJ 07932, April 2010.

Download: [PDF]

Entry Submitted: 04/01/2010
Entry Accepted: 04/01/2010
Entry Last Modified: 05/02/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society