{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:44:45Z","timestamp":1761965085091,"version":"3.37.3"},"reference-count":52,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"content-version":"vor","delay-in-days":23,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1171243"],"award-info":[{"award-number":["1171243"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1190129"],"award-info":[{"award-number":["1190129"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008736","name":"Fondo de Fomento al Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["ID16I10449"],"award-info":[{"award-number":["ID16I10449"]}],"id":[{"id":"10.13039\/501100008736","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2019,3,29]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>Using the approximate algorithms, we are faced with the problem of determining the appropriate values of their input parameters, which is always a complex task and is considered an optimization problem. In this context, incorporating online control parameters is a very interesting issue. The aim is to vary the parameters during the run so that the studied algorithm can provide the best convergence rate and, thus, achieve the best performance. In this paper, we compare the performance of a self-adaptive approach for the biogeography-based optimization algorithm using the mutation rate parameter with respect to its original version and other heuristics. This work proposes altering some parameters of the metaheuristic according to its exhibited efficiency. To test this approach, we solve the set covering problem, which is a classical optimization benchmark with many industrial applications such as line balancing production, crew scheduling, service installation, databases, among several others. We illustrate encouraging experimental results, where the proposed approach is capable of reaching various global optimums for a well-known instance set taken from the Beasleys OR-Library, and sometimes, it improves the results obtained by the original version of the algorithm.<\/jats:p>","DOI":"10.1051\/ro\/2019039","type":"journal-article","created":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T07:51:35Z","timestamp":1554105095000},"page":"1033-1059","source":"Crossref","is-referenced-by-count":5,"title":["A self-adaptive biogeography-based algorithm to solve the set covering problem"],"prefix":"10.1051","volume":"53","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0582-954X","authenticated-orcid":false,"given":"Rodrigo","family":"Olivares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Riquelme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gino","family":"Astorga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Cort\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.cie.2015.04.007","volume":"85","author":"Al-Shihabi","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"R2","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1016\/j.asoc.2013.02.001","volume":"13","author":"Amini","year":"2013","journal-title":"App. Soft Comput."},{"key":"R3","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"Balas","year":"1996","journal-title":"Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"Beasley","year":"1987","journal-title":"Eur. J. Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"Beasley","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"R6","first-page":"125","volume":"79","author":"Caprara","year":"1997","journal-title":"Math. Program."},{"key":"R7","unstructured":"Caserta M., Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Metaheuristics. Springer Nature, Basingstoke (2007) 43\u201363."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2017\/8404231","volume":"2017","author":"Crawford","year":"2017","journal-title":"Complexity"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Crawford B., Soto R., Berros N., Johnson F. and Paredes F., Solving the set covering problem with binary cat swarm optimization. In: Advances in Swarm and Computational Intelligence, Springer Nature, Basingstoke (2015) 41\u201348.","DOI":"10.1007\/978-3-319-20466-6_4"},{"key":"R10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/578541","volume":"2015","author":"Crawford","year":"2015","journal-title":"Math. Prob. Eng."},{"key":"R11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/189164","volume":"2014","author":"Crawford","year":"2014","journal-title":"Sci. World J."},{"key":"R12","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"Crawford","year":"2013","journal-title":"Expert Syst. App."},{"key":"R13","first-page":"4667","volume":"6","author":"Crawford","year":"2011","journal-title":"Int. J. Phys. Sci."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Crawford B., Soto R., Olea C., Johnson F. and Paredes F., Binary bat algorithms for the set covering problem. In 2015 10th Iberian Conference on Information Systems and Technologies (CISTI). Institute of Electrical and Electronics Engineers (IEEE) (2015).","DOI":"10.1109\/CISTI.2015.7170537"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Crawford B., Soto R., Olivares-Su\u00e1rez M. and Paredes F., A binary firefly algorithm for the set covering problem. In Advances in Intelligent Systems and Computing. Springer Nature, Basingstoke (2014) 65\u201373.","DOI":"10.1007\/978-3-319-06740-7_6"},{"key":"R16","unstructured":"Crawford B., Soto R., Olivares-Su\u00e1rez M. and Paredes F., A binary firefly algorithm for the set covering problem. In: 3rd Computer Science On-line Conference 2014 (CSOC 2014). Vol. 285 of Advances in Intelligent Systems and Computing. Springer International Publishing, Cham (2014) 65\u201373."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Crawford B., Soto R., Pe\u00f1a C., Palma W., Johnson F. and Paredes F., Solving the set covering problem with a shuffled frog leapingalgorithm. In: Intelligent Information and Database Systems. Springer Nature, Basingstoke (2015) 41\u201350.","DOI":"10.1007\/978-3-319-15705-4_5"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Crawford B., Soto R., Torres-Rojas C., Pe\u00f1a C., Riquelme-Leiva M., Misra S., Johnson F. and Paredes F., A binary fruit fly optimization algorithm to solve the set covering problem. In: Computational Science and Its Applications \u2013 ICCSA 2015. Springer Nature, Basingstoke (2015) 411\u2013420.","DOI":"10.1007\/978-3-319-21410-8_32"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Cuesta R., Crawford B., Soto R. and Paredes F., An artificial bee colony algorithm for the set covering problem. In: Advances in Intelligent Systems and Computing. Springer Nature, Basingstoke (2014) 53\u201363.","DOI":"10.1007\/978-3-319-06740-7_5"},{"key":"R20","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"Fisher","year":"1990","journal-title":"Manage. Sci."},{"key":"R21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.2307\/3009018","volume":"27","author":"Foster","year":"1976","journal-title":"Oper. Res. Q. (1970\u20131977)"},{"key":"R22","unstructured":"Francesca Rossi T.W. And VanBeek P., Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science, Amsterdam (2006)."},{"key":"R23","unstructured":"Garey M.R. and Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1979)."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Han L., Kendall G. and Cowling P., An adaptive length chromosome hyper-heuristic genetic algorithm for a trainer scheduling problem. In: Recent Advances in Simulated Evolution and Learning. World Scientific Pub Co Pte Lt (2004) 506\u2013525.","DOI":"10.1142\/9789812561794_0027"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Jaramillo A., Crawford B., Soto R., Misra S., Olgun E., Rubio \u00c1.G., Salas J. and Villablanca S.M., An approach to solve the set covering problem with the soccer league competition algorithm. In: Computational Science and Its Applications \u2013 ICCSA 2016. Springer Nature, Basingstoke (2016) 373\u2013385.","DOI":"10.1007\/978-3-319-42085-1_29"},{"key":"R26","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"Lan","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R27","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"key":"R28","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/01621459.1967.10482916","volume":"62","author":"Lilliefors","year":"1967","journal-title":"J. Am. Stat. Assoc."},{"key":"R29","doi-asserted-by":"crossref","unstructured":"Ma H. and Simon D., Biogeography-based optimization with blended migration for constrained optimization problems. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation. Association for Computing Machinery (ACM) (2010).","DOI":"10.1145\/1830483.1830561"},{"key":"R30","doi-asserted-by":"crossref","unstructured":"Ma H. and Simon D., Evolutionary Computation with Biogeography-based Optimization. Wiley-ISTE (2017).","DOI":"10.1002\/9781119136507"},{"key":"R31","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"Mann","year":"1947","journal-title":"Ann. Math. Stat."},{"key":"R32","doi-asserted-by":"crossref","unstructured":"Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs. Springer Nature, Basingstoke (1996).","DOI":"10.1007\/978-3-662-03315-9"},{"key":"R33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"Mirjalili","year":"2013","journal-title":"Swarm Evol. Comput."},{"key":"R34","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1108\/17563781111160002","volume":"4","author":"Mo","year":"2011","journal-title":"Int. J. Intel. Comput. Cybern."},{"key":"R35","doi-asserted-by":"crossref","unstructured":"Mudaliar D.N. and Modi N.K., Unraveling travelling salesman problem by genetic algorithm using m-crossover operator. In: 2013 International Conference on Signal Processing, Image Processing & Pattern Recognition. Institute of Electronics Engineers IEEE (2013).","DOI":"10.1109\/ICSIPR.2013.6497974"},{"key":"R36","unstructured":"Panos M.G.R. and Pardalos M., Handbook of Applied Optimization, Oxford University Press, Oxford (2002)."},{"key":"R37","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1007\/s00170-011-3437-9","volume":"58","author":"Rahmati","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R38","unstructured":"Rubio \u00c1.G., Crawford B., Soto R., Olgun E., Misra S., Jaramillo A., Villablanca S.M. and Salas J., Solving the set covering problem with a binary black hole inspired algorithm . In: Computational Science and Its Applications \u2013 ICCSA 2016. Springer Nature, Basingstoke (2016) 207\u2013219."},{"key":"R39","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01589402","volume":"42","author":"Smith","year":"1988","journal-title":"Math. Program."},{"key":"R40","first-page":"621","volume":"20","author":"Soto","year":"2013","journal-title":"Tech. Gazette"},{"key":"R41","doi-asserted-by":"crossref","unstructured":"Soto R., Crawford B., Mu\u00f1oz A., Johnson F. and Paredes F., Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Advances in Intelligent Systems and Computing. Springer Nature, Basingstoke (2015) 89\u201397.","DOI":"10.1007\/978-3-319-18476-0_10"},{"key":"R42","doi-asserted-by":"crossref","unstructured":"Soto R., Crawford B., Olivares R., Barraza J., Johnson F. and Paredes F., A binary cuckoo search algorithm for solving the set covering problem. In: Lecture Notes in Computer Science. Springer Nature, Basingstoke (2015) 88\u201397.","DOI":"10.1007\/978-3-319-18833-1_10"},{"key":"R43","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ins.2015.01.035","volume":"308","author":"Soto","year":"2015","journal-title":"Inf. Sci."},{"key":"R44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/580785","volume":"2015","author":"Soto","year":"2015","journal-title":"Math. Prob. Eng."},{"key":"R45","doi-asserted-by":"crossref","unstructured":"Soto R., Crawford B., Vega E. and Paredes F., Solving manufacturing cell design problems using an artificial fish swarm algorithm. In: Lecture Notes in Computer Science. Springer Nature, Basingstoke (2015) 282\u2013290.","DOI":"10.1007\/978-3-319-27060-9_23"},{"key":"R46","first-page":"345","volume":"12","author":"Sundar","year":"2010","journal-title":"Oper. Res."},{"key":"R47","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(95)00012-7","volume":"23","author":"Thompson","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"R48","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"Toregas","year":"1971","journal-title":"Oper. Res."},{"key":"R49","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0377-2217(89)90465-7","volume":"38","author":"Vasko","year":"1989","journal-title":"Eur. J. Oper. Res."},{"key":"R50","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.asoc.2018.02.049","volume":"67","author":"Zhang","year":"2018","journal-title":"App. Soft Comput."},{"key":"R51","doi-asserted-by":"crossref","unstructured":"Zhao B., Deng C., Yang Y. and Peng H., Novel binary biogeography-based optimization algorithm for the knapsack problem. In: Lecture Notes in Computer Science. Springer Nature, Basingstoke (2012) 217\u2013224.","DOI":"10.1007\/978-3-642-30976-2_26"},{"key":"R52","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.eswa.2018.08.012","volume":"115","author":"Zhao","year":"2019","journal-title":"Expert Syst. App."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019039\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T06:32:09Z","timestamp":1694759529000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":52,"journal-issue":{"issue":"3"},"alternative-id":["ro170165"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2019039","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}