A New Genetic Algorithm for Set Covering Problems
Presentation / Conference Contribution
Aickelin, U. A New Genetic Algorithm for Set Covering Problems. Presented at Annual Operational Research Conference 42 (OR 42)
An indirect genetic algorithm for the non-unicost set covering problem is presented. The algorithm is a two-stage meta-heuristic, which in the past was successfully applied to similar multiple-choice optimisation problems. The two stages of the algor... Read More about A New Genetic Algorithm for Set Covering Problems.