An ant-algorithm for the weighted minimum hitting set problem

We present an ant-based algorithm for finding good, near optimal solutions to the weighted minimum hitting set problem. We compare our results with the ones obtained by a greedy procedure and by an ad hoc genetic algorithm.

[1]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[2]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[3]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[4]  John J. Bartholdi,et al.  A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering , 1981, Oper. Res..

[5]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[6]  Vincenzo Cutello,et al.  The Hitting Set Problem and Evolutionary Algorithmic Techniques with ad-hoc Viruses (HEAT-V) , 2003, GECCO.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Melvin A. Breuer,et al.  Simplification of the Covering Problem with Application to Boolean Expressions , 1970, JACM.

[9]  R. E. Marsten,et al.  A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem , 1980 .

[10]  Yan-Bin Jia,et al.  The complexity of sensing by point sampling , 1995 .

[11]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[12]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[13]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[14]  Luca Maria Gambardella,et al.  A Study of Some Properties of Ant-Q , 1996, PPSN.

[15]  David Zuckerman,et al.  NP-complete problems have a version that's hard to approximate , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[16]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[17]  Vincenzo Cutello,et al.  An evolutionary algorithm for the T-constrained variation of Minimum Hitting Set problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[18]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .