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. © 2002 IEEE.
An evolutionary algorithm for the T-constrained variation of Minimum Hitting Set problem
CUTELLO, Vincenzo;PAPPALARDO, FRANCESCO
2002-01-01
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. © 2002 IEEE.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Cutello_evolutionary_algorithm_for_the_T-constrained_variation_of_Minimum_Hitting_Set_problem 2002.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
476.64 kB
Formato
Adobe PDF
|
476.64 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
