A GRASP algorithm to solve the unicost set covering problem

Authors:
Joaquín Bautista;Jordi Pereira
Affiliations:
Escola Tècnica Superior d'Enginyers Industrials de Barcelona, Universitat Politècnica de Catalunya, Av. Diagonal 647, 7th floor, 08028 Barcelona, Spain;Escola Tècnica Superior d'Enginyers Industrials de Barcelona, Universitat Politècnica de Catalunya, Av. Diagonal 647, 7th floor, 08028 Barcelona, Spain
Venue:
Computers and Operations Research
Year:
2007

Citing 10
Cited 6

Optimal solution of set covering/partitioning problems using dual heuristics

Management Science
Efficient local search for very large-scale satisfiability problems

ACM SIGART Bulletin
Tabu Search

Tabu Search
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Local Search Algorithms for SAT: An Empirical Evaluation

Journal of Automated Reasoning
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

Journal of Heuristics
A parallel genetic algorithm to solve the set-covering problem

Computers and Operations Research
A Heuristic Method for the Set Covering Problem

Operations Research
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing

Using a greedy random adaptative search procedure to solve the cover printing problem

Computers and Operations Research
A mixed integer linear program and tabu search approach for the complementary edge covering problem

Advances in Engineering Software
Survey: Covering problems in facility location: A review

Computers and Industrial Engineering
Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm

Neurocomputing
Design guidelines for quality of service support in Optimized Link State Routing-based mobile ad hoc networks

Ad Hoc Networks
A restricted dynamic model for refuse collection network design in reverse logistics

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper presents a GRASP algorithm to solve a special SCP case known in the literature as the unicost set covering problem. The algorithm incorporates a local improvement procedure based on the heuristics to solve binary constraint satisfiability problems (SAT). The quality of the proposed algorithm is tested on a set of reference instances, comparing the obtained results with those found in the literature. Our algorithm improves the best-known solutions for many of these instances.