Parallel randomized heuristics for the set covering problem

Authors:
Maria Stella Fiorenzo Catalano;Federico Malucelli
Affiliations:
Transportation and Traffic Engineering Section, Delft University of Technology, P.O. Box 5048 - 2600 GA Delft, The Netherlands;DEI - Politecnico di Milano, Piazza L. da Vinci 32 - 20133 Milano, Italy
Venue:
Practical parallel computing
Year:
2001

Citing 3
Cited 2

Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science
A Heuristic Algorithm for the Set Covering Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Automated Selection of Appropriate Pheromone Representations in Ant Colony Optimization

Artificial Life
A survey on parallel ant colony optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a general scheme to derive heuristics for the Set Covering Problem. The scheme is iterative and embeds constructive heuristics within a randomized procedure. A first group of heuristics is obtained by randomizing the choices made at each step when the solution is constructed in a way similar to that of the so called "Ant System"; a second group of more efficient heuristics is obtained by introducing a random perturbation of the costs of the problem instance. Some computational results are presented. Different parallel implementations are discussed and some performance measures reported.