Journal article

An Indirect Genetic Algorithm for Set Covering Problems

Uwe Aickelin

Journal of the Operational Research Society | Taylor & Francis Ltd | Published : 2002

Abstract

This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, ie the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other parameters. Second, it will be shown that results can be further improved by adding another indirect optimisation layer. The decoder will not directly seek out low cost solutions but instead aims for good exploitable solutions. These are then post-optimised by another hill-climbing algorithm. Although seemingly more complicated, we will show that this ..

View full abstract

University of Melbourne Researchers