An indirect genetic algorithm for set covering problems
U Aickelin ()
Additional contact information
U Aickelin: University of the West of England
Journal of the Operational Research Society, 2002, vol. 53, issue 10, 1118-1126
Abstract:
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 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.
Keywords: heuristics; optimisation; scheduling (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (13)
Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601317 Abstract (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:53:y:2002:i:10:d:10.1057_palgrave.jors.2601317
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
DOI: 10.1057/palgrave.jors.2601317
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().