Computer Science – Neural and Evolutionary Computing
Scientific paper
2008-03-20
Journal of the Operational Research Society, 53(10), pp 1118-1126 2002
Computer Science
Neural and Evolutionary Computing
Scientific paper
10.1057/palgrave.jors.2601317
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, i.e. 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 three-stage approach has advantages in terms of solution quality, speed and adaptability to new types of problems over more direct approaches. Extensive computational results are presented and compared to the latest evolutionary and other heuristic approaches to the same data instances.
No associations
LandOfFree
An Indirect Genetic Algorithm for Set Covering Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Indirect Genetic Algorithm for Set Covering Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Indirect Genetic Algorithm for Set Covering Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-577840