Skip to main content
Article thumbnail
Location of Repository

A New Genetic Algorithm for Set Covering Problems

By Uwe Aickelin

Abstract

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 decoder routine. First, the solutions to the problem are encoded as permutations of the rows to be covered, which are subsequently ordered by the genetic algorithm. Fitness assignment is handled by the decoder, which transforms the permutations into actual solutions to the set covering problem. This is done by exploiting both problem structure and problem specific information. However, flexibility is retained by a self-adjusting element within the decoder, which allows adjustments to both the data and to stages within the search process. Computational results are presented

OAI identifier: oai:eprints.nottingham.ac.uk:606
Provided by: Nottingham ePrints

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.