Skip to main content

Research Repository

See what's under the surface

Advanced Search

An indirect genetic algorithm for set covering problems

Aickelin, Uwe

Authors

Uwe Aickelin



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, 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.

Journal Article Type Article
Publication Date Jan 1, 2002
Journal Journal of the Operational Research Society
Print ISSN 0160-5682
Publisher Taylor & Francis
Peer Reviewed Peer Reviewed
Volume 53
Issue 10
Pages 1118-1126
APA6 Citation Aickelin, U. (2002). An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society, 53(10), 1118-1126 . doi:10.1057/palgrave.jors.2601317
DOI https://doi.org/10.1057/palgrave.jors.2601317
Keywords Heuristics, Optimisation, Scheduling
Publisher URL https://www.tandfonline.com/doi/abs/10.1057/palgrave.jors.2601317
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf
Additional Information This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version Aickelin, Uwe (2002) 'An Indirect Genetic Algorithm for Set Covering Problems'. Journal of the Operational Research Society, 53(10) . pp. 1118-1126. is available online via the offical url given here.

Files

02jors_igascp.pdf (260 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;