Abstract
We present a novel application of the Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. We present a 2-level metaheuristic approach where an Artificial Bee Colony Algorithm acts as a low-level metaheuristic and its paremeters are set by a higher level Genetic Algorithm.
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
Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. The Scientific World Journal 2014(189164), 1–8 (2014)
Crawford, B., Soto, R., Monfroy, E., Castro, C., Palma, W., Paredes, F.: A hybrid soft computing approach for subset problems. Mathematical Problems in Engineering 2013(716069), 1–12 (2013)
Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part II. LNCS, vol. 7929, pp. 27–34. Springer, Heidelberg (2013)
Crawford, B., Valenzuela, C., Soto, R., Monfroy, E., Paredes, F.: Parameter tuning of metaheuristics using metaheuristics. Advanced Science Letters 19(12), 3556–3559 (2013), http://www.ingentaconnect.com/content/asp/asl/2013/00000019/00000012/art00026
Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8(2), 67–71 (1989)
Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey (2005)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (abc) algorithm. J. Global Optimization 39(3), 459–471 (2007)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Plenum Press, New York (1972)
Ren, Z.G., Feng, Z.R., Ke, L.J., Zhang, Z.J.: New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering 58(4), 774–784 (2010), http://www.sciencedirect.com/science/article/pii/S0360835210000471
Singh, A.: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl. Soft Comput. 9(2), 625–631 (2009), http://dx.doi.org/10.1016/j.asoc.2008.09.001
Valenzuela, C., Crawford, B., Soto, R., Monfroy, E., Paredes, F.: A 2-level metaheuristic for the set covering problem. Int. J. Comput. Commun. 7(2), 377–387 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Crawford, B., Soto, R., Palma, W., Johnson, F., Paredes, F., Olguín, E. (2014). A 2-level Approach for the Set Covering Problem: Parameter Tuning of Artificial Bee Colony Algorithm by Using Genetic Algorithm. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-11857-4_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11856-7
Online ISBN: 978-3-319-11857-4
eBook Packages: Computer ScienceComputer Science (R0)