A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem

DOI10.1111/ITOR.12419MaRDI QIDQ4601628zbMATH OpenOpenAlexFDO

Authors Ruben Interian, Celso C. Ribeiro

Publication date 24 January 2018

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12419

zbMATH Keywords

traveling salesman problemGRASPpath-relinkingrestartsSteiner traveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• Compact formulations of the Steiner traveling salesman problem and related problems
• A hybrid GRASP with perturbations for the Steiner problem in graphs
• GRASP with path-relinking for the TSP
• The Steiner traveling salesman problem and its extensions
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Cited in

(13)

• MLQCC: an improved local search algorithm for the set k‐covering problem
• Compact formulations of the Steiner traveling salesman problem and related problems
• A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
• A hybrid GRASP with perturbations for the Steiner problem in graphs
• 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
• The Steiner travelling salesman problem with correlated costs
• GRASP with path-relinking for the TSP
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms
• Reactive tabu search with path-relinking for the Steiner problem in graphs
• An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
• Improving a constructive heuristic for the general routing problem
• A note on computational aspects of the Steiner traveling salesman problem

This page was built for publication: A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem

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