{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:17:24Z","timestamp":1742973444305,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420912"},{"type":"electronic","value":"9783319420929"}],"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-42092-9_11","type":"book-chapter","created":{"date-parts":[[2016,6,30]],"date-time":"2016-06-30T06:02:55Z","timestamp":1467266575000},"page":"129-138","source":"Crossref","is-referenced-by-count":0,"title":["A Weed Colonization Inspired Algorithm for the Weighted Set Cover Problem"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Ismael Fuenzalida","family":"Leg\u00fce","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2014.01.011","volume":"55","author":"Y Adulyasak","year":"2015","unstructured":"Adulyasak, Y., Cordeau, J.-F., Jans, R.: The production routing problem: a review of formulations and solution algorithms. Comput. Oper. Res. 55, 141\u2013152 (2015)","journal-title":"Comput. Oper. Res."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.trb.2015.06.002","volume":"79","author":"R Bai","year":"2015","unstructured":"Bai, R., Xue, N., Chen, J., Roberts, G.W.: A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem. Transp. Res. Part B: Methodol. 79, 134\u2013148 (2015)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"11","key":"11_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2012.08.032","volume":"163","author":"V Cacchiani","year":"2014","unstructured":"Cacchiani, V., Hemmelmayr, V.C., Tricoire, F.: A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Appl. Math. 163, 53\u201364 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"11_CR5","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730\u2013743 (1999)","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"11_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1\u20134), 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"11_CR7","first-page":"175","volume":"10","author":"S Chen","year":"2013","unstructured":"Chen, S., Shen, Y.: An improved column generation algorithm for crew scheduling problems. J. Inf. Comput. Sci. 10(1), 175\u2013183 (2013)","journal-title":"J. Inf. Comput. Sci."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-319-21410-8_33","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Aballay, F., Misra, S., Johnson, F., Paredes, F.: A teaching-learning-based optimization algorithm for solving set covering problems. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 421\u2013430. Springer, Heidelberg (2015)"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"8","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. Scientific World J. 2014, 8 (2014)","journal-title":"Scientific World J."},{"key":"11_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/978-3-319-07857-1_86","volume-title":"HCI International 2014 - Posters\u2019 Extended Abstracts","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Using the bee colony optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCI 2014, Part I. CCIS, vol. 434, pp. 493\u2013497. Springer, Heidelberg (2014)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-642-38715-9_4","volume-title":"Advances in Swarm Intelligence","author":"B Crawford","year":"2013","unstructured":"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\u201334. Springer, Heidelberg (2013)"},{"issue":"3","key":"11_CR12","first-page":"252","volume":"17","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Palma, W., Paredes, F., Olguin, E., Norero, E.: A binary coded firefly algorithm that solves the set covering problem. Rom. J. Inf. Sci. Technol. 17(3), 252\u2013264 (2014)","journal-title":"Rom. J. Inf. Sci. Technol."},{"key":"11_CR13","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-319-18473-9_31","volume-title":"Software Engineering in Intelligent Systems","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Pe\u00f1a, 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.) CSOC2015. AISC, vol. 349, pp. 317\u2013326. Springer, Heidelberg (2015)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/978-3-319-21410-8_32","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Torres-Rojas, C., Pe\u00f1a, C., Riquelme-Leiva, M., Misra, S., Johnson, F., Paredes, F.: A binary fruit fly optimization algorithm to solve the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 411\u2013420. Springer, Heidelberg (2015)"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.cor.2013.11.006","volume":"44","author":"MG Elizondo-Amaya","year":"2014","unstructured":"Elizondo-Amaya, M.G., R\u00c3os-Mercado, R.Z., D\u00c3az, J.A.: A dual bounding scheme for a territory design problem. Comput. Oper. Res. 44, 193\u2013205 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"11_CR16","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","volume":"62","author":"RZ Farahani","year":"2012","unstructured":"Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M.: Covering problems in facility location: a review. Comput. Ind. Eng. 62(1), 368\u2013407 (2012)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"11_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"11_CR18","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.ejor.2011.12.038","volume":"219","author":"S Juette","year":"2012","unstructured":"Juette, S., Thonemann, U.W.: Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems. Eur. J. Oper. Res. 219(2), 214\u2013223 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"11_CR19","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"AR Mehrabian","year":"2006","unstructured":"Mehrabian, A.R., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecol. Inform. 1(4), 355\u2013366 (2006)","journal-title":"Ecol. Inform."},{"issue":"11","key":"11_CR20","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/mnsc.16.11.692","volume":"16","author":"C Revelle","year":"1970","unstructured":"Revelle, C., Marks, D., Liebman, J.C.: An analysis of private and public sector location models. Manag. Sci. 16(11), 692\u2013707 (1970)","journal-title":"Manag. Sci."},{"issue":"2","key":"11_CR21","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(81)90210-1","volume":"6","author":"JA Schreuder","year":"1981","unstructured":"Schreuder, J.A.: Application of a location model to fire stations in rotterdam. Eur. J. Oper. Res. 6(2), 212\u2013219 (1981)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.dam.2013.10.024","volume":"165","author":"B Simeone","year":"2014","unstructured":"Simeone, B., Nouno, G., Mezzadri, M., Lari, I.: A boolean theory of signatures for tonal scales. Discrete Appl. Math. 165, 283\u2013294 (2014)","journal-title":"Discrete Appl. Math."},{"key":"11_CR23","first-page":"286354:1","volume":"2015","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Galleguillos, C., Paredes, F., Norero, E.: A hybrid alldifferent-Tabu search algorithm for solving sudoku puzzles. Comput. Int. Neurosci. 2015, 286354:1\u2013286354:10 (2015)","journal-title":"Comput. Int. Neurosci."},{"key":"11_CR24","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-319-18476-0_10","volume-title":"Artificial Intelligence Perspectives and Applications","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Mu\u00f1oz, A., Johnson, F., Paredes, F.: Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. AISC, vol. 347, pp. 89\u201397. Springer, Heidelberg (2015)"},{"issue":"6","key":"11_CR25","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)","journal-title":"Oper. Res."},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Veenhuis, C.: Binary invasive weed optimization. In: 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC), pp. 449\u2013454. IEEE (2010)","DOI":"10.1109\/NABIC.2010.5716311"},{"issue":"1","key":"11_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR28","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/opre.22.2.275","volume":"22","author":"W Walker","year":"1974","unstructured":"Walker, W.: Using the set-covering problem to assign fire companies to fire houses. Oper. Res. 22, 275\u2013277 (1974)","journal-title":"Oper. Res."},{"key":"11_CR29","unstructured":"Xu, Y., Kochenberger, G., Wang, H.: Pre-processing method with surrogate constraint algorithm for the set covering problem"},{"key":"11_CR30","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.ins.2014.03.017","volume":"277","author":"J Zhang","year":"2014","unstructured":"Zhang, J., Wei, Q., Chen, G.: A heuristic approach for $$\\lambda $$ \u03bb -representative information retrieval from large-scale data. Inf. Sci. 277, 825\u2013841 (2014)","journal-title":"Inf. Sci."}],"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-42092-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:31:38Z","timestamp":1498311098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42092-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420912","9783319420929"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42092-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}