Path‐relinking intensification methods for stochastic local search algorithms

Path‐relinking intensification methods for stochastic local search algorithms

0.00 Avg rating0 Votes
Article ID: iaor20122785
Volume: 18
Issue: 2
Start Page Number: 193
End Page Number: 214
Publication Date: Apr 2012
Journal: Journal of Heuristics
Authors: ,
Keywords: stochastic processes, heuristics: local search, heuristics: tabu search
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 tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions.

Reviews

Required fields are marked *. Your email address will not be published.