An indirect genetic algorithm for set covering problems

Journal of the Operational Research Society

Volumn 53, Issue 10 SPEC., 2002, Pages 1118-1126

  Aickelin, Uwe ^a  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

Heuristics; Optimisation; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; DECODING; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

SET PARTITIONING PROBLEMS;

SCHEDULING;

EID: 0036792139     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601317     Document Type: Article

References (23)

1. Michalewicz Z. (1995). A survey of constraint handling techniques in evolutionary computation methods. In: J.R., McDonnell, R.G., Reynolds, D.B. Fogel (eds). Proceedings of the 4th Annual Conference on Evolutionary Programming. MIT Press: Cambridge, pp 135-155.
2. Garey M. and Johnson D. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman: San Francisco.
3. Caprara A., Fischetti M. and Toth P. (1999). A heuristic method for the set covering problem. Opns Res 47: 730-743.
4. Caprara A., Fischetti M. and Toth P. (1999). Algorithms for the set covering problem. Working paper, DEIS, University of Bologna, Italy.
5. Holland J. (1976). Adaptation in Natural and Artificial Systems. University of Michigan Press: Ann Arbor.
6. Fogel D. (1998). Evolutionary Computation: The Fossil Record. IEEE Press/John Wiley & Sons: New York.
7. De Jong K. (1993). Genetic algorithms are NOT function optimisers. In: Whitley D. (ed). Foundations of Genetic Algorithms, Vol. 2. Morgan Kaufmann: San Mateo, pp 5-17.
8. Deb K. (1996). Genetic algorithms for function optimisation. In: Herrera F. and Verdegay J.L. (eds). Studies in Fuzziness and Soft Computing, Vol. 8. Physica Verlag: Heidelberg, pp 4-31.
9. Bäck T., Hoffmeister F. and Schwefel H.-P. (1993). Applications of Evolutionary Algorithms, 5th edn. Technical Report No. sys -2192, UNI DO sys, Dortmund.
10. Chaiyaratana N. and Zalzala A. (1997). Recent developments in evolutionary and genetic algorithms: theory and applications. In: Fleming P. and Zalzala S. (eds). Genetic Algorithms in Engineering Systems 2: Innovations and Applications. IEEE Press: Letchworth, UK, pp 270-277.
11. Reeves C. (1997). Genetic algorithms for the operations researcher. INFORMS 45: 231-250.
12. Davidor Y. (1991). Epistasis variance: a viewpoint on GA-hardness. In: Rawlins G. (ed). Foundations of Genetic Algorithms. Morgan Kaufmann: San Mateo, pp 23-35.
13. Aickelin U. and Dowsland K. (2002). A comparison of indirect genetic algorithm approaches to multiple choice problems. J Heuristics, to appear.
14. Aickelin U. and Dowsland K. (1999). An indirect genetic algorithm approach to a nurse scheduling problem. Comput Opns Res, submitted.
15. Aickelin U. and Dowsland K. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J Schedul 3: 139-153.
16. Richardson J., Palmer M., Liepins G. and Hilliard M. (1989). Some guidelines for genetic algorithms with penalty functions. In: Schaffer J. (ed). Proceedings of the Third International Conference on Genetic Algorithms and their Applications. Morgan Kaufmann: San Mateo, pp 191-197.
17. Smith A. and Tate D. (1993). Genetic optimization using a penalty function. In: Forrest S. (ed). Proceedings of the Fifth International Reference on Genetic Algorithms. Morgan Kaufmann: San Mateo, pp 499-505.
18. Davis L. (1985). Adapting operator probabilities in genetic algorithms. In: Grefenstette J. (ed). Proceedings of the First International Reference on Genetic Algorithms and their Applications. Lawrence Erlbaum: Hillsdale, NJ, pp 61-67.
19. Tuson A. and Ross P. (1998). Adapting operator settings in genetic algorithms. Evolut Comput 6: 161-184.
20. Beasley J. (1990). OR-library: distributing test problems by electronic mail. J Opl Res Soc 41: 1069-1072.
21. Beasley J. and Chu P. (1996). A genetic algorithm for the set covering problem. Eur J Opl Res 94: 392-404.
22. Reeves C. (1996). Hybrid genetic algorithms for bin-packing and related problems. Annal OR 63: 371-396.
23. Goldberg D. and Lingle R. (1985). Alleles, loci, and the travelling salesman problem. In: Grefenstette J. (ed). Proceedings of the First International Reference on Genetic Algorithms and their Applications. Lawrence Erlbaum: Hillsdale, NJ, pp 154-159.