{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:20:07Z","timestamp":1742966407934,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213798"},{"type":"electronic","value":"9783319213804"}],"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"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","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-21380-4_96","type":"book-chapter","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T02:15:38Z","timestamp":1437358538000},"page":"567-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recent Harmony Search Algorithms for 0\u20131 Optimization Problems"],"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":"N\u00e9stor","family":"Guzm\u00e1n","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","reference":[{"issue":"1","key":"96_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0377-2217(89)90471-2","volume":"38","author":"AI Ali","year":"1989","unstructured":"Ali, A.I., Thiagarajan, H.: A network relaxation based enumeration algorithm for set partitioning. Eur. J. Oper. Res. 38(1), 76\u201385 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"96_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Evolutionary Programming VII","year":"1998","unstructured":"Porto, V.W., Waagen, D. (eds.): EP 1998. LNCS, vol. 1447. Springer, Heidelberg (1998)"},{"issue":"2","key":"96_CR3","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"ML Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Oper. Res. 12(2), 300\u2013304 (1964)","journal-title":"Oper. Res."},{"issue":"4\u2013part\u2013i","key":"96_CR4","doi-asserted-by":"publisher","first-page":"B174","DOI":"10.1287\/mnsc.18.4.B174","volume":"18","author":"M Bellmore","year":"1971","unstructured":"Bellmore, M., Ratliff, H.D.: Optimal defense of multi-commodity networks. Manag. Sci. 18(4\u2013part\u2013i), B174\u2013B185 (1971)","journal-title":"Manag. Sci."},{"issue":"1","key":"96_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/321556.321572","volume":"17","author":"MA Breuer","year":"1970","unstructured":"Breuer, M.A.: Simplification of the covering problem with application to boolean expressions. J. ACM 17(1), 166\u2013181 (1970)","journal-title":"J. ACM"},{"key":"96_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"96_CR7","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1093\/comjnl\/14.4.418","volume":"14","author":"N Christofides","year":"1971","unstructured":"Christofides, N.: Zero-one programming using non-binary tree-search. Comput. J. 14(4), 418\u2013421 (1971)","journal-title":"Comput. J."},{"key":"96_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","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)"},{"issue":"189164","key":"96_CR9","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":"96_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"96_CR11","doi-asserted-by":"publisher","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-a function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40, 1690\u20131695 (2013)","journal-title":"Expert Syst. Appl."},{"key":"96_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-11857-4_22","volume-title":"Advances in Swarm Intelligence","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Palma, W., Johnson, F., Paredes, F., Olgu\u00edn, E.: A 2-level approach for the set covering problem: parameter tuning of artificial bee colony algorithm by using genetic algorithm. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds.) ICSI 2014, Part I. LNCS, vol. 8794, pp. 189\u2013196. Springer, Heidelberg (2014)"},{"key":"96_CR13","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-06740-7_5","volume-title":"Modern Trends and Techniques in Computer Science","author":"R Cuesta","year":"2014","unstructured":"Cuesta, R., Crawford, B., Soto, R., Paredes, F.: An artificial bee colony 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. Advances in Intelligent Systems and Computing, vol. 285, pp. 53\u201363. Springer, Heidelberg (2014)"},{"issue":"3","key":"96_CR14","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1287\/opre.13.3.482","volume":"13","author":"RH Day","year":"1965","unstructured":"Day, R.H.: Letter to the editoron optimal extracting from a multiple file data storage system: an application of integer programming. Oper. Res. 13(3), 482\u2013494 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"96_CR15","doi-asserted-by":"publisher","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":"96_CR16","first-page":"361","volume":"18","author":"BA Freeman","year":"1967","unstructured":"Freeman, B.A., Jucker, J.V.: The line balancing problem. J. Ind. Eng. 18, 361\u2013364 (1967)","journal-title":"J. Ind. Eng."},{"issue":"8","key":"96_CR17","doi-asserted-by":"publisher","first-page":"B495","DOI":"10.1287\/mnsc.16.8.B495","volume":"16","author":"RS Garfinkel","year":"1970","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Optimal political districting by implicit enumeration techniques. Manage. Sci. 16(8), B495\u2013B508 (1970)","journal-title":"Manage. Sci."},{"issue":"2","key":"96_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"key":"96_CR19","first-page":"20","volume":"39","author":"D Gouwanda","year":"2008","unstructured":"Gouwanda, D., Ponnambalam, S.: Evolutionary search techniques to solve set covering problems. World Acad. Sci. Eng. Tech. 39, 20\u201325 (2008)","journal-title":"World Acad. Sci. Eng. Tech."},{"issue":"5","key":"96_CR20","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":"96_CR21","doi-asserted-by":"publisher","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"X Kong","year":"2015","unstructured":"Kong, X., Gao, L., Ouyang, H., Li, S.: A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst. Appl. 42, 5337\u20135355 (2015)","journal-title":"Expert Syst. Appl."},{"key":"96_CR22","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, Heidelberg (1996)","edition":"3"},{"issue":"4","key":"96_CR23","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z Ren","year":"2010","unstructured":"Ren, Z., Feng, Z., Ke, L., Zhang, Z.: New ideas for applying ant colony optimization to the set covering problem. Comput. & Ind. Eng. 58(4), 774\u2013784 (2010)","journal-title":"Comput. & Ind. Eng."},{"issue":"11","key":"96_CR24","doi-asserted-by":"publisher","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":"96_CR25","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"CC Ribeiro","year":"1989","unstructured":"Ribeiro, C.C., Minoux, M., Penna, M.C.: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment. Eur. J. Oper. Res. 41(2), 232\u2013239 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"96_CR26","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1057\/palgrave.jors.2601317","volume":"53","author":"U Aickelin","year":"2002","unstructured":"Aickelin, U.: An indirect genetic algorithm for set covering problems. J. Oper. Res. Soc. 53(10), 1118\u20131126 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"96_CR27","doi-asserted-by":"publisher","first-page":"377","DOI":"10.15837\/ijccc.2012.2.1417","volume":"7","author":"C Valenzuela","year":"2012","unstructured":"Valenzuela, C., Crawford, B., Monfroy, E., Soto, R., Paredes, F.: A 2-level metaheuristic for the set covering problem. Int. J. Comput. Commun. Control 7(2), 377\u2013387 (2012)","journal-title":"Int. J. Comput. Commun. Control"},{"issue":"3","key":"96_CR28","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."},{"key":"96_CR29","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-15859-9_6","volume-title":"Life System Modeling and Intelligent Computing","author":"L Wang","year":"2010","unstructured":"Wang, L., Xu, Y., Mao, Y., Fei, M.: A discrete harmony search algorithm. In: Li, K., Li, X., Ma, S., Irwin, G.W. (eds.) LSMS 2010. CCIS, vol. 98, pp. 37\u201343. Springer, Heidelberg (2010)"},{"key":"96_CR30","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2012.12.043","volume":"232","author":"L Wang","year":"2013","unstructured":"Wang, L., Yang, R., Xu, Y., Niu, Q., Pardalos, P.M., Fei, M.: An improved adaptive binary harmony search algorithm. Inf. Sci. 232, 58\u201387 (2013)","journal-title":"Inf. Sci."},{"issue":"2","key":"96_CR31","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou, D., Gao, L., Li, S., Wu, J.: Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl. Soft Comput. 11(2), 1556\u20131564 (2011)","journal-title":"Appl. Soft Comput."}],"container-title":["Communications in Computer and Information Science","HCI International 2015 - Posters\u2019 Extended Abstracts"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21380-4_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T14:25:45Z","timestamp":1593181545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21380-4_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213798","9783319213804"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21380-4_96","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}