论文信息 - An evolutionary algorithm for the T-constrained variation of Minimum Hitting Set problem

An evolutionary algorithm for the T-constrained variation of Minimum Hitting Set problem

We propose an evolutionary algorithm to approximate optimal solutions to instances of the T-constrained variation of the Minimum Hitting Set Problem. The base problem, Minimum Hitting Set, is a well known /spl Nscr//spl Pscr/-complete problem. Our genetic algorithm will use the idea of viruses which infect chromosomes and change one of their bits. A special dynamic fitness function has been also used to improve overall performance.

Vincenzo Cutello | Francesco Pappalardo | E. Mastriani

[1] Giorgio Ausiello,et al. Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..

[2] 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.

[3] 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.

[4] Aravind Srinivasan,et al. Improved approximations of packing and covering problems , 1995, STOC '95.

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

[6] Refael Hassin,et al. Approximation algorithms for hitting objects with straight lines , 1991, Discret. Appl. Math..

[7] A Genetic Algorithm by Use of Virus Evolutionary Theory for Combinatorial Problems , 2002, PDPTA.

[8] Kalyanmoy Deb,et al. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[9] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .

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