Path-relinking intensification methods for stochastic local search algorithms

Authors:
Celso C. Ribeiro;Mauricio G. Resende
Affiliations:
Department of Computer Science, Universidade Federal Fluminense, Niterói, Brazil 24210-240;Algorithms and Optimization Research Department, AT&T Labs Research, Florham Park, USA 07932
Venue:
Journal of Heuristics
Year:
2012

Citing 24
Cited 4

Good solutions to discrete noxious location problems via metaheuristics

Annals of Operations Research - Special issue on locational decisions
Variable neighborhood search

Computers and Operations Research
Scatter search and path relinking

New ideas in optimization
Tabu Search

Tabu Search
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

INFORMS Journal on Computing
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
Scatter search

Advances in evolutionary computing
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics)

The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics)
A GRASP and Path Relinking Heuristic for Rural Road Network Development

Journal of Heuristics
GRASP with Path Relinking for Three-Index Assignment

INFORMS Journal on Computing
Path relinking for the vehicle routing problem

Journal of Heuristics
GRASP with path relinking for the weighted MAXSAT problem

Journal of Experimental Algorithmics (JEA)
Efficient parallel cooperative implementations of GRASP heuristics

Parallel Computing
GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms

SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
GRASP and path relinking for the max-min diversity problem

Computers and Operations Research
Tabu search with path relinking for an integrated production-distribution problem

Computers and Operations Research
Evaluating las vegas algorithms: pitfalls and remedies

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Computational aspects of the maximum diversity problem

Operations Research Letters

Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime

Expert Systems with Applications: An International Journal
An integrated simulation model and evolutionary algorithm for train timetabling problem with considering train stops for praying

Proceedings of the Winter Simulation Conference
GRASP with evolutionary path-relinking for the capacitated arc routing problem

Computers and Operations Research
Randomized heuristics for handover minimization in mobility networks

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.