{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:37:33Z","timestamp":1742938653054,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420844"},{"type":"electronic","value":"9783319420851"}],"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-42085-1_12","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T02:50:27Z","timestamp":1467341427000},"page":"153-165","source":"Crossref","is-referenced-by-count":0,"title":["Set Covering Problem Resolution by\u00a0Biogeography-Based Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Riquelme","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"5","key":"12_CR1","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1016\/j.asoc.2013.02.001","volume":"13","author":"F Amini","year":"2013","unstructured":"Amini, F., Ghaderi, P.: Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers. Appl. Soft Comput. 13(5), 2272\u20132280 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"12_CR2","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"issue":"2","key":"12_CR3","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"JE Beasley","year":"1992","unstructured":"Beasley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293\u2013300 (1992). http:\/\/ideas.repec.org\/a\/eee\/ejores\/v58y1992i2p293-300.html","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"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\u2013627 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"12_CR5","first-page":"125","volume":"79","author":"A Caprara","year":"1997","unstructured":"Caprara, A., Fischetti, M., Toth, P., Vigo, D., Guida, P.L.: Algorithms for railway crew management. Math. Program. 79(1\u20133), 125\u2013141 (1997). http:\/\/dx.doi.org\/10.1007\/BF02614314","journal-title":"Math. Program."},{"key":"12_CR6","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-0-387-71921-4_3","volume-title":"Metaheuristics","author":"M Caserta","year":"2007","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Metaheuristics. OR\/CSIS, vol. 39, pp. 43\u201363. Springer, Heidelberg (2007). http:\/\/dx.doi.org\/10.1007\/978-0-387-71921-4_3"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","first-page":"41","volume-title":"Advances in Swarm and Computational Intelligence","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Berr\u00edos, N., Johnson, F., Paredes, F.: Solving the set covering problem with binary cat swarm optimization. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds.) ICSI-CCI 2015. LNCS, vol. 9140, pp. 41\u201348. Springer, Heidelberg (2015)"},{"issue":"189164","key":"12_CR8","doi-asserted-by":"crossref","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."},{"issue":"5","key":"12_CR9","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"B Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40(5), 1690\u20131695 (2013)","journal-title":"Expert Syst. Appl."},{"key":"12_CR10","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":"12_CR11","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":"12_CR12","doi-asserted-by":"crossref","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, 1\u20138 (2014)","journal-title":"Sci. World J."},{"key":"12_CR13","first-page":"4667","volume":"6","author":"B Crawford","year":"2011","unstructured":"Crawford, B., Soto, R., Monfroy, E., 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":"12_CR14","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-319-06740-7_6","volume-title":"Modern Trends and Techniques in Computer Science","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, 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\u201373. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10.1007\/978-3-319-06740-7_6"},{"key":"12_CR15","unstructured":"Eremeev, A.V., Kolokolov, A.A., Zaozerskaya, L.A.: A hybrid algorithm for set covering problem. In: Proceedings of International Workshop Discrete Optimization Methods in Scheduling and Computer-Aided Design, pp. 123\u2013129 (2000)"},{"issue":"6","key":"12_CR16","doi-asserted-by":"crossref","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":"1","key":"12_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/1520-6750(198902)36:1<27::AID-NAV3220360103>3.0.CO;2-0","volume":"36","author":"ML Fisher","year":"1989","unstructured":"Fisher, M.L., Rosenwein, M.B.: An interactive optimization system for bulk-cargo ship scheduling. Naval Res. Logistics (NRL) 36(1), 27\u201342 (1989)","journal-title":"Naval Res. Logistics (NRL)"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1057\/jors.1976.63","volume":"27","author":"BA Foster","year":"1976","unstructured":"Foster, B.A., Ryan, D.: An integer programming approach to the vehicle scheduling problem. Oper. Res. 27, 367\u2013384 (1976)","journal-title":"Oper. Res."},{"key":"12_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1990)"},{"key":"12_CR20","first-page":"139","volume":"5","author":"DE Goldberg","year":"1990","unstructured":"Goldberg, D.E.: Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Syst. 5, 139\u2013167 (1990)","journal-title":"Complex Syst."},{"key":"12_CR21","unstructured":"Guanghui Lan, A., Depuy, G.W.B., G.E.W.C.: Discrete optimization an effectiveand simple heuristic for the set covering problem abstract (2005)"},{"key":"12_CR22","unstructured":"Han, L., Kendall, G., Cowling, P.: An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem. In: Proceedings of the fourth Asia-Pacific Conference on Simulated Evolution And Learning, (SEAL 2002), Orchid Country Club, Singapore, pp. 267\u2013271 (2002)"},{"key":"12_CR23","unstructured":"Ma, H., Simon, D.: Biogeography-based optimization with blended migration for constrained optimization problems. In: Pelikan, M., Branke, J. (eds.) Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7\u201311, 2010. pp. 417\u2013418. ACM (2010). http:\/\/doi.acm.org\/10.1145\/1830483.1830561"},{"key":"12_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms + data structures = evolution programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic algorithms + data structures = evolution programs, 3rd edn. Springer-Verlag, London, UK (1996)","edition":"3"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/978-3-642-13495-1_50","volume-title":"Advances in Swarm Intelligence","author":"H Mo","year":"2010","unstructured":"Mo, H., Xu, L.: Biogeography migration algorithm for traveling salesman problem. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010, Part I. LNCS, vol. 6145, pp. 405\u2013414. Springer, Heidelberg (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-13495-1_50"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Mudaliar, D., Modi, N.: 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, February 2013","DOI":"10.1109\/ICSIPR.2013.6497974"},{"issue":"2","key":"12_CR27","doi-asserted-by":"crossref","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). http:\/\/EconPapers.repec.org\/RePEc:eee:ejores:v:205:y:2010:i:2","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"12_CR28","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon, D.: Biogeography-based optimization. Evol. Comput. IEEE Trans. 12(6), 702\u2013713 (2008)","journal-title":"Evol. Comput. IEEE Trans."},{"issue":"1","key":"12_CR29","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01589402","volume":"42","author":"BM Smith","year":"1988","unstructured":"Smith, B.M.: Impacs - a bus crew scheduling system using integer programming. Math. Program. 42(1), 181\u2013187 (1988). http:\/\/dx.doi.org\/10.1007\/BF01589402","journal-title":"Math. Program."},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-319-18833-1_10","volume-title":"Bioinspired Computation in Artificial Systems","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. In: Vicente, J.M.F., \u00c1lvarez-S\u00e1nchez, J.R., L\u00f3pez, F.P., Toledo-Moreo, F.J., Adeli, H. (eds.) Bioinspired Computation in Artificial Systems. LNCS, vol. 9108, pp. 88\u201397. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-18833-1_10"},{"key":"12_CR31","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(95)00012-7","volume":"23","author":"G Thomson","year":"1996","unstructured":"Thomson, G.: A simulated annealing heuristic for shift-scheduling using non-continuously available employees. Comput. Oper. Res. 23, 275\u2013288 (1996)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"12_CR32","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C Toregas","year":"1971","unstructured":"Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The location of emergency service facilities. Oper. Res. 19(6), 1363\u20131373 (1971). http:\/\/dx.doi.org\/10.1287\/opre.19.6.1363","journal-title":"Oper. Res."},{"issue":"1","key":"12_CR33","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0377-2217(89)90465-7","volume":"38","author":"FJ Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: A set covering approach to metallurgical grade assignment. Eur. J. Oper. Res. 38(1), 27\u201334 (1989). http:\/\/EconPapers.repec.org\/RePEc:eee:ejores:v:38:y:1989:i:1:p:27-34","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR34","unstructured":"Xu, Y., Kochenberger, G., Wang, H.: Pre-processing method with surrogate constraint algorithm for the set covering problem (2008)"},{"key":"12_CR35","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-642-18129-0_33","volume-title":"Intelligent Computing and Information Science","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Wu, L., Wang, S., Huo, Y.: Chaotic artificial bee colony used for cluster analysis. In: Chen, R. (ed.) ICICIS 2011 Part I. CCIS, vol. 134, pp. 205\u2013211. Springer, Heidelberg (2011). http:\/\/dx.doi.org\/10.1007\/978-3-642-18129-0_33"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-3-642-30976-2_26","volume-title":"Advances in Swarm Intelligence","author":"BB Zhao","year":"2012","unstructured":"Zhao, B.B., Deng, C., Yang, Y., Peng, H.: Novel binary biogeography-based optimization algorithm for the knapsack problem. In: Tan, Y., Shi, Y., Ji, Z. (eds.) ICSI 2012, Part I. LNCS, vol. 7331, pp. 217\u2013224. Springer, Heidelberg (2012). http:\/\/dx.doi.org\/10.1007\/978-3-642-30976-2_26"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42085-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T09:56:46Z","timestamp":1568109406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}