{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:01:46Z","timestamp":1743134506220,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214092"},{"type":"electronic","value":"9783319214108"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21410-8_32","type":"book-chapter","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T15:57:14Z","timestamp":1434643034000},"page":"411-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Torres-Rojas","sequence":"additional","affiliation":[]},{"given":"Cristian","family":"Pe\u00f1a","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Riquelme-Leiva","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,19]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Amini, F., Ghaderi, P.: Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers. Appl. Soft Comput., 2272\u20132280 (2013)","DOI":"10.1016\/j.asoc.2013.02.001"},{"key":"32_CR2","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0120886","volume-title":"Combinatorial Optimization","author":"E Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization. Mathematical Programming Studies, vol. 12, pp. 37\u201360. Elsevier North-Holland, The Netherlands (1980)"},{"issue":"2","key":"32_CR3","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"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley, J.E.: An algorithm for set covering problem. European Journal of Operational Research 31(1), 85\u201393 (1987)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"32_CR5","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":"0","key":"32_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 setcovering problems. Annals of Operations Research 86(0), 611\u2013627 (1999)","journal-title":"Annals of Operations Research"},{"key":"32_CR7","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","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., 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)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. The Scientific World Journal 2014 (2014)","DOI":"10.1155\/2014\/189164"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-a function based hyperheuristic using particle swarm optimization. Expert Systems with Applications, 1690\u20131695 (2013)","DOI":"10.1016\/j.eswa.2012.09.013"},{"key":"32_CR10","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","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-Surez, 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)"},{"key":"32_CR11","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":"32_CR12","unstructured":"Goldberg, D.: Real-coded genetic algorithms, virtual alphabets, and blocking, pp. 139\u2013167. Complex Systems (1990)"},{"key":"32_CR13","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), pp. 267\u2013271. Orchid Country Club, Singapore (2002)"},{"issue":"3\u20134","key":"32_CR14","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s00521-011-0769-1","volume":"22","author":"S-M Lin","year":"2013","unstructured":"Lin, S.-M.: Analysis of service satisfaction in web auction logistics service using a combination of fruit fly optimization algorithm and general regression neural network. Neural Computing and Applications 22(3\u20134), 783\u2013791 (2013)","journal-title":"Neural Computing and Applications"},{"key":"32_CR15","doi-asserted-by":"publisher","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 (1996)","edition":"3"},{"issue":"0","key":"32_CR16","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(0), 1\u201314 (2013)","journal-title":"Swarm and Evolutionary Computation"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.knosys.2011.07.001","volume":"26","author":"W-T Pan","year":"2012","unstructured":"Pan, W.-T.: A new fruit fly optimization algorithm: Taking the financial distress model as an example. Knowl.-Based Syst. 26, 69\u201374 (2012)","journal-title":"Knowl.-Based Syst."},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Ren, Z., Feng, Z., Ke, L., Zhang, Z.: New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering, 774\u2013784 (2010)","DOI":"10.1016\/j.cie.2010.02.011"},{"key":"32_CR19","unstructured":"Shi, Y., Eberhart, R.: Empirical study of particle swarm optimization. In: Proc. of the Congress on Evolutionary Computation, pp. 1945\u20131950 (1999)"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.knosys.2013.04.003","volume":"48","author":"L Wang","year":"2013","unstructured":"Wang, L., Zheng, X., Wang, S.: A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowl.-Based Syst. 48, 17\u201323 (2013)","journal-title":"Knowl.-Based Syst."},{"issue":"0","key":"32_CR21","first-page":"378","volume":"37","author":"H ze Li","year":"2013","unstructured":"ze Li, H., Guo, S., jie Li, C., qi Sun, J.: A hybrid annual power load forecasting model based on generalized regression neural network with fruit fly optimization algorithm. Knowledge-Based Systems 37(0), 378\u2013387 (2013)","journal-title":"Knowledge-Based Systems"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications -- ICCSA 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21410-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T13:02:51Z","timestamp":1675861371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21410-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214092","9783319214108"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21410-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}