{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:50:11Z","timestamp":1725853811791},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336237"},{"type":"electronic","value":"9783319336251"}],"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-33625-1_39","type":"book-chapter","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T14:42:39Z","timestamp":1461163359000},"page":"437-447","source":"Crossref","is-referenced-by-count":4,"title":["A Nature Inspired Intelligent Water Drop Algorithm and Its Application for Solving The Set Covering Problem"],"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":"Jorge","family":"C\u00f3rdova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,21]]},"reference":[{"issue":"15","key":"39_CR1","doi-asserted-by":"crossref","first-page":"6555","DOI":"10.1016\/j.eswa.2014.05.010","volume":"41","author":"Basem O. Alijla","year":"2014","unstructured":"Alijla, B.O., Lim, C.P., Wong, L.-P., Al-Betar, M.A., Khader, A.T.: A modified intelligent water drops algorithm and its application to optimization problems. Exp. Syst. Appl. 41, 6555\u20136569 (2014)","journal-title":"Expert Systems with Applications"},{"key":"39_CR2","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":"J Beasley","year":"1990","unstructured":"Beasley, J.: A lagrangian heuristic for set covering problems. Nav. Res. Logist. 37, 151\u2013164 (1990)","journal-title":"Nav. Res. Logist."},{"key":"39_CR3","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."},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Aballay, F., Misra, S., Johnson, F., Paredes, F.: Computational Science and Its Applications\u2014ICCSA 2015: 15th International Conference, Banff, AB, Canada, June 22\u201325, 2015, Proceedings, Part IV, chapter A Teaching-Learning-Based Optimization Algorithm for Solving Set Covering Problems, pp. 421\u2013430. Springer International Publishing, Cham (2015)","DOI":"10.1007\/978-3-319-21410-8_33"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/189164","volume":"2014","author":"Broderick 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., Article ID 189164, 1\u20138 (2014)","journal-title":"The Scientific World Journal"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: 3rd Computer Science On-line Conference 2014, Modern Trends and Techniques in Computer Science, vol. 285, pp. 65\u201373. Springer (2014)","DOI":"10.1007\/978-3-319-06740-7_6"},{"key":"39_CR7","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, 4th International Conference","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.) Advances in Swarm Intelligence, 4th International Conference. Lecture Notes in Computer Science, vol. 7929, pp. 27\u201334. Springer, Harbin, China (2013)"},{"key":"39_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-319-15705-4_5","volume-title":"Intelligent Information and Database Systems\u20147th Asian Conference","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Pe\u00f1a, C., Palma, W., Johnson, F., Paredes, F.: Solving the set covering problem with a shuffled frog leaping algorithm. In: Nguyen, N.T., Trawinski, B., Kosala, R. (eds.) Intelligent Information and Database Systems\u20147th Asian Conference. LNCS, vol. 9012, pp. 41\u201350. Springer, Bali, Indonesia (2015)"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C Fleurent","year":"1999","unstructured":"Fleurent, C., Glover, F.: Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11(2), 198\u2013204 (1999)","journal-title":"INFORMS J. Comput."},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.amc.2014.03.110","volume":"237","author":"Kostas Florios","year":"2014","unstructured":"Florios, Kostas, Mavrotas, George: Generation of the exact pareto set in multi-objective traveling salesman and set covering problems. Appl. Math. Comput. 237, 1\u201319 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"39_CR11","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Zhi-Gang 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., pp. 774\u2013784 (2010)","journal-title":"Computers & Industrial Engineering"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Shah-Hosseini, H.: Problem solving by intelligent water drops. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 3226\u20133231 (2007)","DOI":"10.1109\/CEC.2007.4424885"},{"issue":"2","key":"39_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1108\/17563780810874717","volume":"1","author":"Hamed Shah-Hosseini","year":"2008","unstructured":"Shah-Hosseini, Hamed: Intelligent water drops algorithm: a new optimization method for solving the multiple knapsack problem. Int. J. Intell. Comput. Cybern. 1(2), 193\u2013212 (2008)","journal-title":"Int. J. Intell. Comput. Cybern."},{"issue":"2","key":"39_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1108\/17563780810874717","volume":"1","author":"Hamed Shah-Hosseini","year":"2008","unstructured":"Shah-Hosseini, Hamed: A new optimization method for solving the multiple knapsack problem. Int. J. Intell. Comput. Cybern. 1(2), 193\u2013212 (2008)","journal-title":"Int. J. Intell. Comput. Cybern."},{"key":"39_CR15","unstructured":"ThangaMariappan L., Kesavamoorthy, R., ArunShunmugam, D.: Solving traveling salesman problem by modified intelligent water drop algorithm. In: International Conference on Emerging Technology Trends, vol. 2, pp. 18\u201323 (2007)"}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33625-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T18:27:17Z","timestamp":1692296837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33625-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336237","9783319336251"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33625-1_39","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}