Abstract
The set covering problem seeks for minimum cost family of subsets from n given subsets, which together covers the complete set. In this article, we present multi dynamic binary black hole algorithm for resolving the set covering problem. This algorithm has the particularity to propose a generic dynamic binarization method to manage the exploration and exploitation properties. Furthermore we explore the implementation of the algorithm on Apache Spark distributed framework.
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
Similar content being viewed by others
References
Abdelaziz, A.Y., Osama, R.A., El-Khodary, S.M., Panigrahi, B.K.: Distribution systems reconfiguration using the hyper-cube ant colony optimization algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds.) SEMCCO 2011. LNCS, vol. 7077, pp. 257–266. Springer, Heidelberg (2011). doi:10.1007/978-3-642-27242-4_30
Tayarani-N, M.H., Akbarzadeh-T, M.R.: Magnetic optimization algorithms, a new synthesis. In: IEEE International Conference on Evolutionary Computation, pp. 2659–2664 (2008)
Bacanin, N., Brajevic, I., Tuba, M.: Firefly algorithm applied to integer programming problems. Recent Adv. Math. 143–148 (2013)
Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392–404 (1996)
Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost-and coverage-correlated set-covering problems. Ann. Oper. Res. 86, 611–627 (1999)
Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730–743 (1999)
Crawford, B., Soto, R., Berríos, N., Johnson, F., Paredes, F., Castro, C., Norero, E.: A binary cat swarm optimization algorithm for the non-unicost set covering problem. In: Mathematical Problems in Engineering (2015)
Crawford, B., Soto, R., Monfroy, E., Paredes, F., Palma, W.: A hybrid ant algorithm for the set covering problem. Int. J. Phys. Sci. 6(19), 4667–4673 (2014)
Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Modern Trends and Techniques in Computer Science. AISC, vol. 285, pp. 65–73. Springer, Heidelberg (2014). doi:10.1007/978-3-319-06740-7_6
Crawford, B., Soto, R., Peña, C., Riquelme-Leiva, M., Torres-Rojas, C., Johnson, F., Paredes, F.: Binarization methods for shuffled frog leaping algorithms that solve set covering problems. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 317–326. Springer, Heidelberg (2015). doi:10.1007/978-3-319-18473-9_31
Gary, M.R., Johnson, D.S.: Computers and intractability. A Guide to the Theory of NP-Completeness (1979)
Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175–184 (2013)
Beasley, J.: A lagrangian heuristic for set-covering problems. Naval Res. Logistics (NRL) 37(1), 151–164 (1990)
Lozano, M., Molina, D., García-Martínez, C., Herrera, F.: Evolutionary algorithms and other metaheuristics for continuous optimization problems (2010)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
Shyam, R., Kumar, S., Poornachandran, P., Soman, K.P.: Apache Spark a big data analytics platform for smart grid. Procedia Technol. 21, 171–178 (2015)
Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. In: Ferrández Vicente, J.M., Álvarez-Sánchez, J.R., de la Paz López, F., Toledo-Moreo, F.J., Adeli, H. (eds.) IWINAC 2015. LNCS, vol. 9108, pp. 88–97. Springer, Heidelberg (2015). doi:10.1007/978-3-319-18833-1_10
Vasko, F.J., Knolle, P.J., Spiegel, D.S.: An empirical study of hybrid genetic algorithms for the set covering problem. J. Oper. Res. Soc. 56(10), 1213–1223 (2005)
Venter, G., Sobieszczanski-Sobieski, J.: Multidisciplinary optimization of a transport aircraft wing using particle swarm optimization. Struct. Multi. Optim. 26(1–2), 121–131 (2004)
Yelbay, B., Birbil, Şİ., Bülbül, K.: The set covering problem revisited: an empirical study of the value of dual information. J. Ind. Manage. Optim. 11(2), 575–594 (2015)
Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. HotCloud 10, 10 (2010)
Zhai, Y., Ong, Y.-S., Tsang, I.W.: The emerging big dimensionality. IEEE Comput. Intell. Mag. 9(3), 14–26 (2014)
Acknowledgments
Broderick Crawford is supported by Grant CONICYT/ FONDECYT/REGULAR/1140897 and Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1160455.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
García, J., Crawford, B., Soto, R., García, P. (2017). A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem. In: Del Ser, J. (eds) Harmony Search Algorithm. ICHSA 2017. Advances in Intelligent Systems and Computing, vol 514. Springer, Singapore. https://doi.org/10.1007/978-981-10-3728-3_6
Download citation
DOI: https://doi.org/10.1007/978-981-10-3728-3_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3727-6
Online ISBN: 978-981-10-3728-3
eBook Packages: EngineeringEngineering (R0)