Abstract
This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem is a reasonably well known NP-complete optimization problem with many real world applications. We use a cultural evolutionary architecture to maintain knowledge of diversity and fitness learned over each generation during the search process. The proposed approach is validated using benchmark instances, and its results are compared with respect to other approaches which have been previously adopted to solve the problem. Our results indicate that the approach is able to produce very competitive results in compare with other algorithms solving the portfolio of test problems taken from the ORLIB.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beasley, J.E.: Or-library:distributing test problem by electronic mail. Journal of Operational Research Society 41(11), 1069–1072 (1990), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)
Chu, P.C., Beasley, J.E.: Constraint handling in genetic algorithms: The set partitioning problem. Journal of Heuristics 4(4), 323–357 (1998)
Coello, C.A., Landa, R.: Constrained Optimization Using an Evolutionary Programming-Based Cultural Algorithm. In: Parmee, I. (ed.) Proceedings of the Fifth International Conference on Adaptive Computing Design and Manufacture (ACDM 2002), University of Exeter, Devon, UK, vol. 5, pp. 317–328. Springer (April 2002)
Crawford, B., Castro, C.: Integrating lookahead and post processing procedures with aco for solving set partitioning and covering problems. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 1082–1090. Springer, Heidelberg (2006)
Crawford, B., Lagos, C., Castro, C., Paredes, F.: A cultural algorithm for solving the set covering problem. In: Melin, P., Castillo, O., Gómez-Ramírez, E., Kacprzyk, J., Pedrycz, W. (eds.) Analysis and Design of Intelligent Systems using Soft Computing Techniques. ASC, vol. 41, pp. 408–415. Springer, Heidelberg (2007)
Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67–71 (1989)
Gomes, F.C., Meneses, C.N., Pardalos, P.M., Viana, G.V.R.: Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Comput. Oper. Res. 33(12), 3520–3534 (2006)
Landa, R., Coello, C.A.: Optimization with constraints using a cultured differential evolution approach. In: GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 27–34. ACM Press, New York (2005)
Landa, R., Coello, C.A.: Use of domain information to improve the performance of an evolutionary algorithm. In: GECCO 2005: Proceedings of the 2005 Workshops on Genetic and Evolutionary Computation, pp. 362–365. ACM Press, New York (2005)
Lozano, M., Herrera, F., Cano, J.R.: Replacement strategies to preserve useful diversity in steady-state genetic algorithms. In: Proceedings of the 8th Online World Conference on Soft Computing in Industrial Applications (September 2003)
Peng, B.: Knowledge and population swarms in cultural algorithms for dynamic environments. PhD thesis, Detroit, MI, USA, Adviser-Reynolds, R.G. (2005)
Reynolds, R.: An introduction to cultural algorithms. In: Third Annual Conference on Evolutionary Programming, pp. 131–139 (1994)
Reynolds, R.G.: Cultural algorithms: theory and applications. In: New Ideas in Optimization, pp. 367–378. McGraw-Hill Ltd., Maidenhead (1999)
Reynolds, R.G., Peng, B.: Cultural algorithms: Modeling of how cultures learn to solve problems. In: ICTAI, pp. 166–172. IEEE Computer Society (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crawford, B., Soto, R., Monfroy, E. (2013). Cultural Algorithms for the Set Covering Problem. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38715-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-38715-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38714-2
Online ISBN: 978-3-642-38715-9
eBook Packages: Computer ScienceComputer Science (R0)