A hybrid heuristic for the set covering problem

DOI10.1007/S12351-010-0086-YzbMath1273.90180OpenAlexW2069729403MaRDI QIDQ373244

Alok Singh, Shyam Sundar

Publication date: 22 October 2013

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

Full work available at URL: https://doi.org/10.1007/s12351-010-0086-y

zbMATH Keywords

combinatorial optimizationheuristicset covering problemswarm intelligenceartificial bee colony algorithm

Mathematics Subject Classification ID

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

Related Items (7)

A scheme for determining vehicle routes based on Arc-based service network design ⋮ A binary cat swarm optimization algorithm for the non-unicost set covering problem ⋮ Improved artificial bee colony algorithm for global optimization ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Multi-strategy ensemble artificial bee colony algorithm ⋮ A self-adaptive biogeography-based algorithm to solve the set covering problem ⋮ Exploring further advantages in an alternative formulation for the set covering problem

Uses Software

• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective and simple heuristic for the set covering problem
• Enhancing an algorithm for set covering problems
• A genetic algorithm for the set covering problem
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• A Lagrangian-based heuristic for large-scale set covering problems
• Logical analysis of numerical data
• An algorithm for set covering problem
• A comparative study of artificial bee colony algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A 3-flip neighborhood local search for the set covering problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• An Integer Programming Approach to the Vehicle Scheduling Problem
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
• An indirect genetic algorithm for set covering problems
• A Heuristic Method for the Set Covering Problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• The Location of Emergency Service Facilities
• Algorithms for the set covering problem

This page was built for publication: A hybrid heuristic for the set covering problem