Abstract
In this paper we compare the effects of using various stochastic operators with the non-unicost set-covering problem. Four different crossover operators are compared to a repair heuristic which consists in transforming infeasible strings into feasible ones. These stochastic operators are incorporated in GENEsYs, the genetic algorithm we apply to problem instances of the set-covering problem we draw from well known test problems. GENEsYs uses a simple fitness function that has a graded penalty term to penalize infeasibly bred strings. The results are compared to a non GA-based algorithm based on the greedy technique. Our computational results are then compared, shedding some light on the effects of using different operators, a penalty function, and a repair heuristic on a highly constrained combinatorial optimization problem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA, 1974.
Th. Bäck. The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 85–94. Elsevier, Amsterdam, 1992.
Th. Bäck and S. Khuri. An evolutionary heuristic for the maximum independent set problem. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 531–535. IEEE Press, 1994.
E. Balas and S. M. Ng. On the set covering polytype: I. All the facets with coefficients in {0,1,2}. Mathematical Programming, 43:57–69, 1989.
J. E. Beasley. A lagrangian heuristic for set-covering problems. Naval Research Logistics, 37:151–164, 1990.
J. E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069–1072, 1990.
J. E. Beasley and P. C. Chu. A genetic algorithm for the set covering problem. Submitted to European Journal of Operational Research for publication, 1994.
M. A. Breuer. Simplification of the covering problem with application ot boolean expressions. Journal of the Association of Computing Machinery, 17:166–181, 1970.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading, MA, 1989.
J. J. Grefenstette. Genesis: A system for using genetic search procedures. In Proceedings of the 1984 Conference on Intelligent Systems and Machines, pages 161–165, 1984.
Wen-Chih Huang, Cheng-Yan Kao, and Jorng-Tzong Horng. A genetic algorithm approach for set covering problems. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 569–574. IEEE Press, 1994.
K. A. De Jong. An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan, 1975. Diss. Abstr. Int. 36(10), 5140B, University Microfilms No. 76-9381.
R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–104. Plenum Press, New York, 1972.
S. Khuri, Th. Bäck, and J. Heitkötter. An evolutionary approach to combinatorial optimization problems. In D. Cizmar, editor, Proceedings of the 22nd Annual ACM Computer Science Conference, pages 66–73. ACM Press, New York, 1994.
D. M. Levine. A genetic algorithm for the set partitioning problem. In S. Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, pages 481–487. Morgan Kaufmann Publishers, San Mateo, CA, 1993.
G. E. Liepins, M. R. Hilliard, J. Richardson, and M. Palmer. Genetic algorithms applications to set covering and traveling salesman problems. In Donald E. Brown and Chelsea C. White III., editors, Operations Research and Artificial Intelligence: The Integration of Problem-Solving Strategies, pages 29–57. Kluwer Academic Publishers, 1990.
H. Mühlenbein. How genetic algorithms really work: I. mutation and hillclimbing. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 15–25. Elsevier, Amsterdam, 1992.
D. Orvosh and L. Davis. Shall we repair ? Genetic algorithms, combinatorial optimization, and feasibility constraints. In S. Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, page 650. Morgan Kaufmann Publishers, San Mateo, CA, 1993.
J. T. Richardson, M. R. Palmer, G. Liepins, and M. Hilliard. Some guidelines for genetic algorithms with penalty functions. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 191–197. Morgan Kaufmann Publishers, San Mateo, CA, 1989.
J. Rubin. A technique for the solution of massive set-covering problems with applications to airline crew scheduling. Transportation Science, 7:34–48, 1973.
S. Sen. Minimal cost set covering using probabilistic methods. In Proceedings 1993 ACM/SIGAPP Symposium on Applied Computing, pages 157–164, 1993.
D. R. Stinson. An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Winnipeg, Manitoba, Canada, 2nd edition, 1987.
G. Syswerda. Uniform crossover in genetic algorithms. In J. D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 2–9. Morgan Kaufmann Publishers, San Mateo, CA, 1989.
W. Walker. Using the set-covering problem to assign fire companies to fire houses. Operations Research, 22:275–277, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bäck, T., Schütz, M., Khuri, S. (1996). A comparative study of a penalty function, a repair heuristic, and stochastic operators with the set-covering problem. In: Alliot, JM., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1995. Lecture Notes in Computer Science, vol 1063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61108-8_47
Download citation
DOI: https://doi.org/10.1007/3-540-61108-8_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61108-0
Online ISBN: 978-3-540-49948-0
eBook Packages: Springer Book Archive