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

Abstract

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.