Using viruses to improve GAs

Authors:
Francesco Pappalardo
Affiliations:
Faculty of Pharmacy and Dept. of Mathematics & Computer Science, University of Catania, Italy
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 7
Cited 0

Efficient probabilistically checkable proofs and applications to approximations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Superior Evolutionary Algorithm for 3-SAT

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we will introduce an evolutionary algorithm for finding approximate solutions to the Weighted Minimum Hitting Set Problem. The proposed genetic algorithm, denoted by HEAT-V, makes use of a newly defined concept of virus. We will test its performance against a well known and efficient greedy algorithm, and on several families of sets.