Skip to main content
Article thumbnail
Location of Repository

An Indirect Genetic Algorithm for Set Covering Problems

By 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

Publisher: Palgrave Macmillan
Year: 2002
OAI identifier: oai:eprints.nottingham.ac.uk:550
Provided by: Nottingham ePrints

Suggested articles

Citations

  1. (1997). 10 Chaiyaratana N and Zalzala A
  2. (2001). A Comparison of Indirect Genetic Algorithm Approaches to Multiple Choice Problems, Journal of Heuristics,
  3. (1996). A Genetic Algorithm for the Set Covering Problem,
  4. (1999). A Heuristic Method for the Set Covering Problem,
  5. (1995). A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In
  6. (1976). Adaptation in Natural and Artificial Systems. Ann Arbor,
  7. (1985). Adapting Operator Probabilities in Genetic Algorithms,
  8. (1998). Adapting Operator Settings in Genetic Algorithms,
  9. (1999). Algorithms for the Set Covering Problem, working paper, DEIS,
  10. (1985). Alleles, Loci, and the Travelling Salesman Problem.
  11. (1999). An indirect genetic algorithm approach to a nurse scheduling problem. Submitted to Computers and Operations Research.
  12. (1979). Computers and Intractability: A guide to the theory of NP-completeness.
  13. (1991). Epistasis Variance: A Viewpoint on GA -Hardness,
  14. (1998). Evolutionary Computation: The Fossil Record .
  15. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem.
  16. (1993). Genetic Algorithms are NOT Function Optimisers.
  17. (1996). Genetic Algorithms for Function Optimisation.
  18. (1997). Genetic Algorithms for the Operations Researcher,
  19. (1993). Genetic Optimization Using a Penalty Function,
  20. (1996). Hybrid Genetic Algorithms for Bin-Packing and Related Problems. doi
  21. (1990). OR-library: distributing test problems by electronic mail,
  22. Size Density Optimum Sol Time Sol Time Sol Time Sol Time doi
  23. (1989). Some Guidelines for Genetic Algorithms with Penalty Functions,

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