Abstract
The Set Covering Problem (SCP) is a classic problem of combinatorial analytic. This problem consists in to find solutions what cover the needs to lower cost. Those can be services to cities, load balancing in production lines or databanks selections. In this paper, we study the resolution of SCP, through Invasive Weed Optimization (IWO), in its binary version; Binary Invasive Weed Optimization (BIWO). IWO, it is to imitate to Invasive Weed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction.
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
Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730–743 (1999)
Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1–4), 353–371 (2000)
Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. Sci. World J. 2014 (2014)
Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Advances in Swarm Intelligence, pp. 27–34. Springer (2013)
Crawford, B., Soto, R., Olivares-Suárez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: Modern Trends and Techniques in Computer Science, pp. 65–73. Springer (2014)
Day, R.H.: Letter to the editor on optimal extracting from a multiple file data storage system: an application of integer programming. Oper. Res. 13(3), 482–494 (1965)
Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67–71 (1989)
Mehrabian, A.R., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecol. Inform. 1(4), 355–366 (2006)
Reynolds, R.G.: An introduction to cultural algorithms. In: Proceedings of the Third Annual Conference on Evolutionary Programming, pp. 131–139, Singapore (1994)
Reynolds, R.G., Peng, B.: Cultural algorithms: modeling of how cultures learn to solve problems. In: 16th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2004. pp. 166–172. IEEE (2004)
Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 6, 18–25 (1955)
Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The location of emergency service facilities. Oper. Res. 19(6), 1363–1373 (1971)
Veenhuis, C.: Binary invasive weed optimization. In: 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC), pp. 449–454. IEEE (2010)
Xu, Y., Kochenberger, G., Wang, H.: Pre-processing method with surrogate constraint algorithm for the set covering problem
Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms. Luniver press (2010)
Acknowledgments
The author Broderick Crawford is supported by grant CONICYT/FONDE-CYT/REGULAR/1140897 and Ricardo Soto is supported by grant CONICYT/ FONDECYT/INICIACION/11130459.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Crawford, B., Soto, R., Legüe, I.F., Olguín, E. (2016). A Binary Invasive Weed Optimization Algorithm for the Set Covering Problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Artificial Intelligence Perspectives in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 464. Springer, Cham. https://doi.org/10.1007/978-3-319-33625-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-33625-1_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33623-7
Online ISBN: 978-3-319-33625-1
eBook Packages: EngineeringEngineering (R0)