{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:51:41Z","timestamp":1770835901215,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319157047","type":"print"},{"value":"9783319157054","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15705-4_5","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T05:21:23Z","timestamp":1426483283000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Solving the Set Covering Problem with a Shuffled Frog Leaping Algorithm"],"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":"Cristian","family":"Pe\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenceslao","family":"Palma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"5_CR1","unstructured":"Balachandar, S.R., Kannan, K.: A meta-heuristic algorithm for set covering problem based on gravity. 4(7), 944\u2013950 (2010)"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","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. Operations Research 44(6), 875\u2013890 (1996)","journal-title":"Operations Research"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: A lagrangian heuristic for set-covering problems. Naval Research Logistics (NRL) 37(1), 151\u2013164 (1990)","journal-title":"Naval Research Logistics (NRL)"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J Beasley","year":"1996","unstructured":"Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392\u2013404 (1996)","journal-title":"European Journal of Operational Research"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee, K.K., Sarmah, S.: Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Applied Soft Computing 19, 252\u2013263 (2014). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494614000799","journal-title":"Applied Soft Computing"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M Brusco","year":"1999","unstructured":"Brusco, M., Jacobs, L., Thompson, G.: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Annals of Operations Research 86, 611\u2013627 (1999)","journal-title":"Annals of Operations Research"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","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. Operations Research 47(5), 730\u2013743 (1999)","journal-title":"Operations Research"},{"key":"5_CR8","first-page":"43","volume-title":"Metaheuristics, Operations Research\/Computer Science Interfaces Series","author":"M Caserta","year":"2007","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R., Reimann, M. (eds.) Metaheuristics, Operations Research\/Computer Science Interfaces Series, vol. 39, pp. 43\u201363. Springer, US (2007)"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581106","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming 81(2), 215\u2013228 (1998)","journal-title":"Mathematical Programming"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E., Castro, C., Palma, W., Paredes, F.: A hybrid soft computing approach for subset problems. Mathematical Problems in Engineering, Article ID 716069, 1\u201312 (2013)","DOI":"10.1155\/2013\/716069"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/TPWRS.2010.2052639","volume":"26","author":"J Ebrahimi","year":"2011","unstructured":"Ebrahimi, J., Hosseinian, S.H., Gharehpetian, G.B.: Unit Commitment Problem Solution Using Shuffled Frog Leaping Algorithm. IEEE Transactions on Power Systems 26(2), 573\u2013581 (2011)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","volume":"129","author":"MM Eusuff","year":"2003","unstructured":"Eusuff, M.M., Lansey, K.E.: Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm. Journal of Water Resources Planning and Management 129(3), 210\u2013225 (2003)","journal-title":"Journal of Water Resources Planning and Management"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff, M., Lansey, K., Pasha, F.: Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Engineering Optimization 38(2), 129\u2013154 (2006). http:\/\/dx.doi.org\/10.1080\/03052150500384759","journal-title":"Engineering Optimization"},{"issue":"5","key":"5_CR15","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.cor.2011.07.010","volume":"39","author":"C Fang","year":"2012","unstructured":"Fang, C., Wang, L.: An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Computers & OR 39(5), 890\u2013901 (2012)","journal-title":"Computers & OR"},{"issue":"6","key":"5_CR16","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. Management Science 36(6), 674\u2013688 (1990)","journal-title":"Management Science"},{"key":"5_CR17","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 (1990)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Glover, F.W., Kochenberger, G.A.: Handbook of Metaheuristics (International Series in Operations Research & Management Science). Springer, January 2003","DOI":"10.1007\/b101874"},{"issue":"5","key":"5_CR19","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E Housos","year":"1997","unstructured":"Housos, E., Elmroth, T.: Automatic optimization of subproblems in scheduling airline crews. Interfaces 27(5), 68\u201377 (1997)","journal-title":"Interfaces"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"5","key":"5_CR21","doi-asserted-by":"publisher","first-page":"2535","DOI":"10.1016\/j.eswa.2013.10.001","volume":"41","author":"J Luo","year":"2014","unstructured":"Luo, J., Chen, M.R.: Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Systems with Applications 41(5), 2535\u20132545 (2014)","journal-title":"Expert Systems with Applications"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Luo, X., Yang, Y., Li, X.: Solving tsp with shuffled frog-leaping algorithm. In: ISDA (3), pp. 228\u2013232. IEEE Computer Society (2008)","DOI":"10.1109\/ISDA.2008.346"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili, S., Lewis, A.: S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm and Evolutionary Computation 9, 1\u201314 (2013)","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"5_CR24","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. European Journal of Operational Research 205(2), 290\u2013300 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"ZG Ren","year":"2010","unstructured":"Ren, Z.G., Feng, Z.R., Ke, L.J., Zhang, Z.J.: New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering 58(4), 774\u2013784 (2010)","journal-title":"Computers & Industrial Engineering"},{"issue":"11","key":"5_CR26","doi-asserted-by":"publisher","first-page":"4244","DOI":"10.1016\/j.asoc.2013.07.006","volume":"13","author":"P Roy","year":"2013","unstructured":"Roy, P., Roy, P., Chakrabarti, A.: Modified shuffled frog leaping algorithm with genetic algorithm crossover for solving economic load dispatch problem with valve-point effect. Appl. Soft Comput. 13(11), 4244\u20134252 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"FJ Vasko","year":"1987","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: Optimal selection of ingot sizes via set covering. Oper. Res. 35(3), 346\u2013353 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"5_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"FJ Vasko","year":"1984","unstructured":"Vasko, F.J., Wilson, G.R.: Using a facility location algorithm to solve large set covering problems. Operations Research Letters 3(2), 85\u201390 (1984)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15705-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:16:20Z","timestamp":1747786580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15705-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319157047","9783319157054"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15705-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}