{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:47:52Z","timestamp":1725940072185},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319725499"},{"type":"electronic","value":"9783319725505"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-72550-5_1","type":"book-chapter","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T07:03:07Z","timestamp":1515654187000},"page":"3-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["A Percentile Transition Ranking Algorithm Applied to Binarization of Continuous Swarm Intelligence Metaheuristics"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gino","family":"Astorga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,12]]},"reference":[{"issue":"6","key":"1_CR1","doi-asserted-by":"crossref","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. Oper. Res. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost-andcoverage-correlated set-covering problems. Ann. Oper. Res. 86, 611\u2013627 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"1_CR3","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."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Astorga, G., Garc\u00eda, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017 (2017)","DOI":"10.1155\/2017\/8404231"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E., Astorga, G., Garc\u00eda, J., Cortes, E.: A meta-optimization approach for covering problems in facility location. In: Workshop on Engineering Applications, pp. 565\u2013578. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-66963-2_50"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-319-15705-4_5","volume-title":"Intelligent Information and Database Systems","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. Intelligent Information and Database Systems, pp. 41\u201350. Springer, Berlin (2015)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Carlos, C., Paredes, F.: A k-means binarization framework applied to multidimensional knapsack problem. Appl. Intell. 1\u201324 (2017)","DOI":"10.1007\/s10489-017-0972-6"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Garc\u00eda, P.: A multi dynamic binary black hole algorithm applied to set covering problem. In: International Conference on Harmony Search Algorithm, pp. 42\u201351. Springer, Berlin (2017)","DOI":"10.1007\/978-981-10-3728-3_6"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Pope, C., Altimiras, F.: A distributed k-means segmentation algorithm applied to lobesia botrana recognition. Complexity 2017 (2017)","DOI":"10.1155\/2017\/5137317"},{"key":"1_CR10","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Graells-Garrido, E., Garc\u00eda, J.: Visual exploration of urban dynamics using mobile data. In: International Conference on Ubiquitous Computing and Ambient Intelligence, pp. 480\u2013491. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-26401-1_45"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, M., Kis, T.: Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. Cent. Eur. J. Oper. Res. 1\u201329 (2017)","DOI":"10.1007\/s10100-017-0489-4"},{"issue":"1","key":"1_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"B John","year":"1990","unstructured":"John, B.: A lagrangian heuristic for set-covering problems. Nav. Res. Logist. (NRL) 37(1), 151\u2013164 (1990)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"2","key":"1_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s13676-015-0080-x","volume":"6","author":"A Kasirzadeh","year":"2017","unstructured":"Kasirzadeh, A., Saddoune, M., Soumis, F.: Airline crew scheduling: models, algorithms, and data sets. EURO J. Transp. Logist. 6(2), 111\u2013137 (2017)","journal-title":"EURO J. Transp. Logist."},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1007\/978-0-387-30164-8_630","volume-title":"Encyclopedia of Machine Learning","author":"J Kennedy","year":"2011","unstructured":"Kennedy, J.: Particle swarm optimization. Encyclopedia of Machine Learning, pp. 760\u2013766. Springer, Berlin (2011)"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.eswa.2016.10.054","volume":"70","author":"JM Lanza-Gutierrez","year":"2017","unstructured":"Lanza-Gutierrez, J.M., Crawford, B., Soto, R., Berrios, N., Gomez-Pulido, J.A., Paredes, F.: Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization. Expert Syst. Appl. 70, 67\u201382 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"1_CR17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s11721-015-0114-x","volume":"9","author":"BJ Leonard","year":"2015","unstructured":"Leonard, B.J., Engelbrecht, A.P., Cleghorn, C.W.: Critical considerations on angle modulated particle swarm optimisers. Swarm Intell. 9(4), 291\u2013314 (2015)","journal-title":"Swarm Intell."},{"issue":"4","key":"1_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/IJAMC.2015100101","volume":"6","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Vasko, F.J.: An or practitioner\u2019s solution approach for the set covering problem. Int. J. Appl. Metaheuristic Comput. (IJAMC) 6(4), 1\u201313 (2015)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"issue":"13","key":"1_CR19","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232\u20132248 (2009)","journal-title":"Inf. Sci."},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-319-18833-1_10","volume-title":"Bioinspired Computation in Artificial Systems","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. Bioinspired Computation in Artificial Systems, pp. 88\u201397. Springer, Berlin (2015)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Stojkovi\u0107, M.: The operational flight and multi-crew scheduling problem. Yugoslav J. Oper. Res. 15(1) (2016)","DOI":"10.2298\/YJOR0501025S"},{"key":"1_CR22","unstructured":"Totonchi, A., Reza, M.: Magnetic optimization algorithms, a new synthesis. In: IEEE International Conference on Evolutionary Computations (2008)"},{"issue":"2","key":"1_CR23","doi-asserted-by":"crossref","first-page":"377","DOI":"10.15837\/ijccc.2012.2.1417","volume":"7","author":"C Valenzuela","year":"2014","unstructured":"Valenzuela, C., Crawford, B., Soto, R., Monfroy, E., Paredes, F.: A 2-level metaheuristic for the set covering problem. Int. J. Comput. Commun. Control 7(2), 377\u2013387 (2014)","journal-title":"Int. J. Comput. Commun. Control"},{"issue":"2","key":"1_CR24","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1504\/IJBIC.2010.032124","volume":"2","author":"X-S Yang","year":"2010","unstructured":"Yang, X.-S.: Firefly algorithm, stochastic test functions and design optimisation. Int. J. Bio-Inspired Comput. 2(2), 78\u201384 (2010)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"1_CR25","unstructured":"Yang, X.-S., Deb, S.: Cuckoo search via l\u00e9vy flights. In: World Congress on Nature and Biologically Inspired Computing, 2009, NaBIC 2009, pp. 210\u2013214. IEEE (2009)"},{"key":"1_CR26","unstructured":"Yelbay, B., Birbil, \u015e.\u0130., B\u00fclb\u00fcl, K.: The set covering problem revisited: an empirical study of the value of dual information. Eur. J. Oper. Res. (2012)"}],"container-title":["Advances in Intelligent Systems and Computing","Recent Advances on Soft Computing and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72550-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T12:19:43Z","timestamp":1719749983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72550-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319725499","9783319725505"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72550-5_1","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018]]}}}