Restart strategies for GRASP with path-relinking heuristics

DOI10.1007/S11590-011-0322-2MaRDI QIDQ691439zbMATH OpenOpenAlexFDO

Authors Mauricio G. C. Resende, Celso C. Ribeiro

Publication date 30 November 2012

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-011-0322-2

zbMATH Keywords

GRASPpath-relinkingexperimental algorithmicsrestart strategy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 2050708
• Experimental and Efficient Algorithms
• GRASP with path relinking for the weighted MAXSAT problem
• GRASP with path relinking for three-index assignment
• GRASP with path-relinking for the TSP

Cites work

• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• A GRASP with path-relinking for private virtual circuit routing
• A probabilistic heuristic for a computationally difficult set covering problem
• An advanced tabu search algorithm for the job shop problem
• An annotated bibliography of GRASP – Part I: Algorithms
• An annotated bibliography of GRASP-Part II: Applications
• Fundamentals of scatter search and path relinking
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• GRASP with path relinking for the weighted MAXSAT problem
• GRASP with path relinking heuristics for the antibandwidth problem
• GRASP with path-relinking for the generalized quadratic assignment problem
• GRASP: An annoted bibliography
• Greedy randomized adaptive search procedures
• Handbook of metaheuristics
• Handbook of metaheuristics
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• On algorithm portfolios and restart strategies
• Optimal speedup of Las Vegas algorithms
• Optimization parallelizing for discrete programming problems
• Randomized heuristics for the Max-Cut problem
• Restart strategies in optimization: parallel and serial cases

Cited in

(7)

• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• An enhanced GRASP approach for the index tracking problem
• Extending time-to-target plots to multiple instances
• Optimal configuration of power distribution networks with variable renewable energy resources
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
• A simple greedy heuristic for linear assignment interdiction

Describes a project that uses

Uses Software

• Scatter Search
• GRASP

This page was built for publication: Restart strategies for GRASP with path-relinking heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691439)