{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T10:24:20Z","timestamp":1782296660583,"version":"3.54.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T00:00:00Z","timestamp":1703548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T00:00:00Z","timestamp":1703548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["303266\/2019-8"],"award-info":[{"award-number":["303266\/2019-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["PPM-676-17"],"award-info":[{"award-number":["PPM-676-17"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["APQ-00417-21"],"award-info":[{"award-number":["APQ-00417-21"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s10732-023-09524-9","type":"journal-article","created":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T15:02:26Z","timestamp":1703602946000},"page":"145-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3144-5181","authenticated-orcid":false,"given":"Guilherme Barbosa","family":"de Almeida","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7801-0087","authenticated-orcid":false,"given":"Elisangela Martins","family":"de S\u00e1","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7831-6740","authenticated-orcid":false,"given":"S\u00e9rgio Ricardo","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7141-357X","authenticated-orcid":false,"given":"Marcone Jamilson Freitas","family":"Souza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,26]]},"reference":[{"issue":"6","key":"9524_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"RK Ahuja","year":"2004","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., et al.: A multi-exchange heuristic for the single-source capacitated facility location problem. Manage. Sci. 50(6), 749\u2013760 (2004). https:\/\/doi.org\/10.1287\/mnsc.1030.0193","journal-title":"Manage. Sci."},{"key":"9524_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10589-007-9125-x","volume":"43","author":"P Avella","year":"2009","unstructured":"Avella, P., Boccia, M.: A cutting plane algorithm for the capacitated facility location problem. Comput. Optim. Appl. 43, 39\u201365 (2009). https:\/\/doi.org\/10.1007\/s10589-007-9125-x","journal-title":"Comput. Optim. Appl."},{"issue":"11","key":"9524_CR3","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990). https:\/\/doi.org\/10.1057\/jors.1990.166","journal-title":"J. Oper. Res. Soc."},{"issue":"13","key":"9524_CR4","doi-asserted-by":"publisher","first-page":"3855","DOI":"10.1080\/00207543.2019.1636320","volume":"58","author":"M Caserta","year":"2020","unstructured":"Caserta, M., Vo\u00df, S.: A general corridor method-based approach for capacitated facility location. Int. J. Prod. Res. 58(13), 3855\u20133880 (2020). https:\/\/doi.org\/10.1080\/00207543.2019.1636320","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"9524_CR5","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.tre.2007.09.001","volume":"44","author":"CH Chen","year":"2008","unstructured":"Chen, C.H., Ting, C.J.: Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transp. Res. Part E Logist. Transp. Rev. 44(6), 1099\u20131122 (2008). https:\/\/doi.org\/10.1016\/j.tre.2007.09.001","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"9524_CR6","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/j.jclepro.2017.07.238","volume":"167","author":"EKF Coelho","year":"2017","unstructured":"Coelho, E.K.F., Mateus, G.R.: A capacitated plant location model for reverse logistics activities. J. Clean. Prod. 167, 1165\u20131176 (2017). https:\/\/doi.org\/10.1016\/j.jclepro.2017.07.238","journal-title":"J. Clean. Prod."},{"key":"9524_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10479-007-0193-1","volume":"157","author":"I Contreras","year":"2008","unstructured":"Contreras, I., D\u00edaz, J.: Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157, 73\u201389 (2008). https:\/\/doi.org\/10.1007\/s10479-007-0193-1","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9524_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(02)00829-9","volume":"151","author":"MJ Cortinhal","year":"2003","unstructured":"Cortinhal, M.J., Captivo, M.E.: Upper and lower bounds for the single source capacitated location problem. Eur. J. Oper. Res. 151(2), 333\u2013351 (2003). https:\/\/doi.org\/10.1016\/S0377-2217(02)00829-9","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"9524_CR9","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1057\/palgrave.jors.2601353","volume":"53","author":"JA D\u00edaz","year":"2002","unstructured":"D\u00edaz, J.A., Fern\u00e1ndez, E.: A branch-and-price algorithm for the single source capacitated plant location problem. J. Oper. Res. Soc. 53(7), 728\u2013740 (2002). https:\/\/doi.org\/10.1057\/palgrave.jors.2601353","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9524_CR10","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1080\/03155986.1999.11732381","volume":"37","author":"H Delmaire","year":"1999","unstructured":"Delmaire, H., D\u00edaz, J.A., Fern\u00e1ndez, E., et al.: Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem. INFOR Inf. Syst. Oper. Res. 37(3), 194\u2013225 (1999). https:\/\/doi.org\/10.1080\/03155986.1999.11732381","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"9524_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Handbook of heuristics","author":"A Duarte","year":"2018","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., et al.: Variable neighborhood descent. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of heuristics, pp. 341\u2013367. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_9"},{"key":"9524_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07153-4_14-1","volume-title":"Matheuristics","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Fischetti, M.: Matheuristics, pp. 1\u201333. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-07153-4_14-1"},{"issue":"9","key":"9524_CR13","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"ML Fisher","year":"1986","unstructured":"Fisher, M.L., Jaikumar, R., Van Wassenhove, L.N.: A multiplier adjustment method for the generalized assignment problem. Manage. Sci. 32(9), 1095\u20131103 (1986). https:\/\/doi.org\/10.1287\/mnsc.32.9.1095","journal-title":"Manage. Sci."},{"issue":"1","key":"9524_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13675-017-0084-4","volume":"6","author":"S Gadegaard","year":"2018","unstructured":"Gadegaard, S., Klose, A., Nielsen, L.: An improved cut-and-solve algorithm for the single-source capacitated facility location problem. EURO J. Comput. Optim. 6(1), 1\u201327 (2018). https:\/\/doi.org\/10.1007\/s13675-017-0084-4","journal-title":"EURO J. Comput. Optim."},{"issue":"5","key":"9524_CR15","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M., Graves, G.W.: Multicommodity distribution system design by benders decomposition. Manage. Sci. 20(5), 822\u2013844 (1974). https:\/\/doi.org\/10.1287\/mnsc.20.5.822","journal-title":"Manage. Sci."},{"key":"9524_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105304","volume":"132","author":"M Gn\u00e4gi","year":"2021","unstructured":"Gn\u00e4gi, M., Baumann, P.: A matheuristic for large-scale capacitated clustering. Comput. Oper. Res. 132, 105304 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105304","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9524_CR17","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2014.04.007","volume":"238","author":"G Guastaroba","year":"2014","unstructured":"Guastaroba, G., Speranza, M.: A heuristic for BILP problems: the single source capacitated facility location problem. Eur. J. Oper. Res. 238(2), 438\u2013450 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.04.007","journal-title":"Eur. J. Oper. Res."},{"key":"9524_CR18","unstructured":"Hansen, P., Mladenovi\u0107, N.: A tutorial on variable neighborhood search. Tech. rep., Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions, GERAD, Montr\u00e9al QC H3T 2A7, Canada (2003). https:\/\/www.gerad.ca\/en\/papers\/G-2003-46, https:\/\/www.gerad.ca\/papers\/G-2003-46.pdf?locale=en"},{"issue":"3","key":"9524_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., et al.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"9524_CR20","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1057\/palgrave.jors.2600698","volume":"50","author":"KS Hindi","year":"1999","unstructured":"Hindi, K.S., Pie\u0144kosz, K.: Efficient solution of large scale, single-source, capacitated plant location problems. J. Oper. Res. Soc. 50(3), 268\u2013274 (1999). https:\/\/doi.org\/10.1057\/palgrave.jors.2600698","journal-title":"J. Oper. Res. Soc."},{"key":"9524_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2014.11.004","volume":"27","author":"SC Ho","year":"2015","unstructured":"Ho, S.C.: An iterated tabu search heuristic for the single source capacitated facility location problem. Appl. Soft Comput. 27, 169\u2013178 (2015). https:\/\/doi.org\/10.1016\/j.asoc.2014.11.004","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"9524_CR22","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K Holmberg","year":"1999","unstructured":"Holmberg, K., R\u00f6nnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113(3), 544\u2013559 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00008-3","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9524_CR23","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"JG Klincewicz","year":"1986","unstructured":"Klincewicz, J.G., Luss, H.: A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37(5), 495\u2013500 (1986). https:\/\/doi.org\/10.1057\/jors.1986.84","journal-title":"J. Oper. Res. Soc."},{"key":"9524_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., et al.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"issue":"11","key":"9524_CR25","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.2307\/2581020","volume":"34","author":"AW Neebe","year":"1983","unstructured":"Neebe, A.W., Rao, M.R.: An algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. 34(11), 1107\u20131113 (1983). https:\/\/doi.org\/10.2307\/2581020","journal-title":"J. Oper. Res. Soc."},{"key":"9524_CR26","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10472-021-09756-0","volume":"89","author":"O Oliveira","year":"2021","unstructured":"Oliveira, O., Matos, T., Gamboa, D.: A dual RAMP algorithm for single source capacitated facility location problems. Ann. Math. Artif. Intell. 89, 815\u2013834 (2021). https:\/\/doi.org\/10.1007\/s10472-021-09756-0","journal-title":"Ann. Math. Artif. Intell."},{"key":"9524_CR27","doi-asserted-by":"publisher","first-page":"576,392","DOI":"10.1100\/2012\/576392","volume":"2012","author":"J Qin","year":"2012","unstructured":"Qin, J., Ni, L.L., Shi, F.: Combined simulated annealing algorithm for the discrete facility location problem. Sci. World J. 2012, 576,392 (2012). https:\/\/doi.org\/10.1100\/2012\/576392","journal-title":"Sci. World J."},{"issue":"3","key":"9524_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0377-2217(93)90219-D","volume":"66","author":"R Sridharan","year":"1993","unstructured":"Sridharan, R.: A Lagrangian heuristic for the capacitated plant location problem with single source constraints. Eur. J. Oper. Res. 66(3), 305\u2013312 (1993). https:\/\/doi.org\/10.1016\/0377-2217(93)90219-D","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9524_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1111\/itor.12103","volume":"22","author":"F Stefanello","year":"2015","unstructured":"Stefanello, F., de Ara\u00fajo, O.C.B., M\u00fcller, F.M.: Matheuristics for the capacitated p-median problem. Int. Trans. Oper. Res. 22(1), 149\u2013167 (2015). https:\/\/doi.org\/10.1111\/itor.12103","journal-title":"Int. Trans. Oper. Res."},{"key":"9524_CR30","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-319-07124-4_8","volume-title":"Handbook of heuristics","author":"T St\u00fctzle","year":"2018","unstructured":"St\u00fctzle, T., Ruiz, R.: Iterated local search. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of heuristics, pp. 579\u2013605. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_8"},{"issue":"1","key":"9524_CR31","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ejor.2017.04.032","volume":"263","author":"TH Tran","year":"2017","unstructured":"Tran, T.H., Scaparra, M.P., O\u2019Hanley, J.R.: A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem. Eur. J. Oper. Res. 263(1), 173\u2013187 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.04.032","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9524_CR32","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10732-021-09468-y","volume":"27","author":"R Turkes","year":"2021","unstructured":"Turkes, R., S\u00f6rensen, K., Cuervo, D.P.: A matheuristic for the stochastic facility location problem. J. Heuristics 27(4), 649\u2013694 (2021)","journal-title":"J. Heuristics"},{"issue":"6","key":"9524_CR33","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biomet. Bull. 1(6), 80\u201383 (1945). https:\/\/doi.org\/10.2307\/3001968","journal-title":"Biomet. Bull."},{"issue":"3","key":"9524_CR34","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2012.03.047","volume":"221","author":"Z Yang","year":"2012","unstructured":"Yang, Z., Chu, F., Chen, H.: A cut-and-solve based algorithm for the single-source capacitated facility location problem. Eur. J. Oper. Res. 221(3), 521\u2013532 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.03.047","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09524-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-023-09524-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09524-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T07:19:27Z","timestamp":1720682367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-023-09524-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,26]]},"references-count":34,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["9524"],"URL":"https:\/\/doi.org\/10.1007\/s10732-023-09524-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,26]]},"assertion":[{"value":"23 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}