A New Genetic Algorithm for Set Covering Problems
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 algorithm are an ‘indirect’ genetic algorithm and a dec...
| Main Author: | |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2000
|
| Online Access: | https://eprints.nottingham.ac.uk/606/ |