A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem

DOI10.1111/ITOR.12725OpenAlexW2979156264WikidataQ127177652 ScholiaQ127177652MaRDI QIDQ6090469

Ruslán G. Marzo, Celso Carneiro Ribeiro

Publication date: 17 November 2023

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

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

zbMATH Keywords

metaheuristicsGRASPpath-relinkingrestartstime-to-target plotsgeneralized minimum spanning tree problemrandomized metaheuristicsprize-collecting generalized minimum spanning tree problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (7)

A GRASP/Path‐Relinking algorithm for the traveling purchaser problem ⋮ A case study of consistent vehicle routing problem with time windows ⋮ An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search ⋮ Fixed set search applied to the clique partitioning problem ⋮ An enhanced GRASP approach for the index tracking problem ⋮ Exact and heuristic solutions for the prize‐collecting geometric enclosure problem ⋮ A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
• Restart strategies for GRASP with path-relinking heuristics
• New models of the generalized minimum spanning tree problem
• Solving group Steiner problems as Steiner problems.
• Generalized spanning trees
• A two-level solution approach for solving the generalized minimum spanning tree problem
• The prize-collecting generalized minimum spanning tree problem
• On the prize-collecting generalized minimum spanning tree problem
• Hybridization of GRASP metaheuristic with data mining techniques
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• Optimization by GRASP
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• On the generalized minimum spanning tree problem
• A heuristic for the minimum cost chromatic partition problem
• Steiner’s problem for set-terminals
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems

This page was built for publication: A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem