{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:50:06Z","timestamp":1725853806230},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336237"},{"type":"electronic","value":"9783319336251"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33625-1_25","type":"book-chapter","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T10:42:39Z","timestamp":1461148959000},"page":"273-283","source":"Crossref","is-referenced-by-count":3,"title":["Biogeography-Based Optimization Algorithm for Solving the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Riquelme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,21]]},"reference":[{"key":"25_CR1","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. Freeman, W. H (1979)"},{"issue":"6","key":"25_CR2","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"Egon Balas","year":"1996","unstructured":"Balas, Egon, Carrera, Maria C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"issue":"6","key":"25_CR3","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Manage. Sci. 36(6), 674\u2013688 (1990)","journal-title":"Manage. Sci."},{"issue":"6","key":"25_CR4","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput. 12(6), 702\u2013713 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"25_CR5","first-page":"217","volume-title":"Lecture Notes in Computer Science","author":"BiBingyan Zhao","year":"2012","unstructured":"Zhao, B., Deng, C., Yang, Y., Peng, Hu.: Novel binary biogeography-based optimization algorithm for the knapsack problem, pp. 217\u2013224 (2012)"},{"issue":"2","key":"25_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"J.E. Beasley","year":"1992","unstructured":"Beasley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293 \u2013 300 (1992) (Practical Combinatorial Optimization)","journal-title":"European Journal of Operational Research"},{"key":"25_CR7","unstructured":"Lan, G., Depuy, G.W., Whitehouse G.E.: Discrete optimization an effective and simple heuristic for the set covering problem abstract (2005)"},{"key":"25_CR8","unstructured":"Eremeev, A.V., Kolokolov, A.A., Zaozerskaya, L.A.: A hybrid algorithm for set covering problem, pp. 123\u2013129 (2000)"},{"key":"25_CR9","first-page":"4667","volume":"6","author":"E Monfroy","year":"2011","unstructured":"Monfroy, E., Crawford, B., Soto, R., Paredes, F., Palma, W.: A hybrid ant algorithm for the set covering problem. Int. J. Phys. Sci. 6, 4667\u20134673 (2011)","journal-title":"Int. J. Phys. Sci."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Berrios, N., Johnson, F., Paredes, F.: Solving the set covering problem with binary cat swarm optimization. In: Advances in Swarm and Computational Intelligence. Lecture Notes in Computer Science, vol. 9140, pp. 41\u201348. Springer International Publishing (2015)","DOI":"10.1007\/978-3-319-20466-6_4"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Olea, C., Johnson, F., Paredes, F.: Binary bat algorithms for the set covering problem. In: 2015 10th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1\u20134, June 2015","DOI":"10.1109\/CISTI.2015.7170537"},{"key":"25_CR12","unstructured":"Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. 9108, 88\u201397 (2015)"},{"issue":"189164","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/189164","volume":"2014","author":"B Crawford","year":"2014","unstructured":"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(189164), 1\u20138 (2014)","journal-title":"Sci. World J."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Olivares Suarez, M., Paredes, F., Johnson, F.: Binary firefly algorithm for the set covering problem. In: 2014 9th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1\u20135, June 2014","DOI":"10.1109\/CISTI.2014.6877090"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Mudaliar, D.N., Modi, N.K.: Unraveling travelling salesman problem by genetic algorithm using m-crossover operator. In: 2013 International Conference on Signal Processing Image Processing Pattern Recognition (ICSIPR), pp. 127\u2013130, Feb 2013","DOI":"10.1109\/ICSIPR.2013.6497974"},{"key":"25_CR16","first-page":"405","volume-title":"Lecture Notes in Computer Science","author":"Hongwei Mo","year":"2010","unstructured":"Mo, H., Xu, L.: Biogeography migration algorithm for traveling salesman problem. In: Advances in Swarm Intelligence, vol. 6145, pp. 405\u2013414. Springer, Heidelberg (2010)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Ma, H., Simon, D.: Biogeography-based optimization with blended migration for constrained optimization problems. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 417\u2013418. ACM, New York, NY, USA (2010)","DOI":"10.1145\/1830483.1830561"},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi, Z., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2), 290\u2013300 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR19","unstructured":"Xu, Y., Kochenberger, G., Wang, H.: Pre-processing method with surrogate constraint algorithm for the set covering problem"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Cuesta, R., Crawford, B., Soto, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. Sci. World J. 4\u20136 (2014)","DOI":"10.2495\/CEEIT140051"}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33625-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:58:09Z","timestamp":1559422689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33625-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336237","9783319336251"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33625-1_25","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}