A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering

DOI10.1016/j.cor.2011.11.018zbMath1348.90643OpenAlexW1972011169MaRDI QIDQ336718

Mauricio G. C. Resende, Luciana S. Pessoa, Celso Carneiro Ribeiro

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.018

zbMATH Keywords

metaheuristicsLagrangean relaxationGRASPlocal searchset coveringhybrid heuristicsLagrangean heuristicspath-relinkingset \(k\)-coveringset multicovering

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Extremal set theory (05D05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (13)

Decomposition based hybrid metaheuristics ⋮ A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem ⋮ Relaxation heuristics for the set multicover problem with generalized upper bound constraints ⋮ A hybrid of max-min ant system and linear programming for the \(k\)-covering problem ⋮ A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Experiments with LAGRASP heuristic for set \(k\)-covering ⋮ A multi-product production/distribution system design problem with direct shipments and lateral transshipments ⋮ Probabilistic stopping rules for GRASP heuristics and extensions ⋮ The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications

Uses Software

• GRASP
• PERL
• OR-Library
• Scatter Search
• TTTPLOTS

Cites Work

• Heuristic solutions and confidence intervals for the multicovering problem
• A probabilistic heuristic for a computationally difficult set covering problem
• The multicovering problem
• Approximation algorithms for combinatorial problems
• Greedy randomized adaptive search procedures
• An algorithm for set covering problem
• TTT plots: a perl program to create time-to-target plots
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• A Greedy Heuristic for the Set-Covering Problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Validation of subgradient optimization
• A Heuristic Method for the Set Covering Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering