{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:20:46Z","timestamp":1773883246108,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Brazilian Institute of Geography and Statistics"},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["310444\/2018-7"],"award-info":[{"award-number":["310444\/2018-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["309832\/2020-9"],"award-info":[{"award-number":["309832\/2020-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/201.344\/2021"],"award-info":[{"award-number":["E-26\/201.344\/2021"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00500-022-07600-z","type":"journal-article","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T03:02:32Z","timestamp":1667185352000},"page":"4685-4698","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7207-1698","authenticated-orcid":false,"given":"Marcelo R. H.","family":"Maia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6978-6780","authenticated-orcid":false,"given":"Miguel","family":"Reula","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9311-7504","authenticated-orcid":false,"given":"Consuelo","family":"Parre\u00f1o-Torres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9573-6541","authenticated-orcid":false,"given":"Prem Prakash","family":"Vuppuluri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4039-0915","authenticated-orcid":false,"given":"Alexandre","family":"Plastino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9209","authenticated-orcid":false,"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-1929","authenticated-orcid":false,"given":"Sara","family":"Ceschia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3421-3293","authenticated-orcid":false,"given":"Mario","family":"Pavone","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,31]]},"reference":[{"issue":"1","key":"7600_CR1","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 (2009) A cutting plane algorithm for the capacitated facility location problem. Comput Optim Appl 43(1):39\u201365","journal-title":"Comput Optim Appl"},{"issue":"6","key":"7600_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10732-008-9078-y","volume":"15","author":"P Avella","year":"2009","unstructured":"Avella P, Boccia M, Sforza A et al (2009) An effective heuristic for large-scale capacitated facility location problems. J Heuristics 15(6):597","journal-title":"J Heuristics"},{"issue":"2","key":"7600_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.ejor.2020.07.033","volume":"289","author":"P Avella","year":"2021","unstructured":"Avella P, Boccia M, Mattia S et al (2021) Weak flow cover inequalities for the capacitated facility location problem. Eur J Oper Res 289(2):485\u2013494","journal-title":"Eur J Oper Res"},{"issue":"1","key":"7600_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.disopt.2003.03.001","volume":"2","author":"F Barahona","year":"2005","unstructured":"Barahona F, Chudak FA (2005) Near-optimal solutions to large-scale facility location problems. Discrete Optim 2(1):35\u201350","journal-title":"Discrete Optim"},{"key":"7600_CR5","doi-asserted-by":"crossref","unstructured":"Birattari M, Yuan Z, Balaprakash P et al (2010) F-race and iterated F-race: an overview. In: Experimental methods for the analysis of optimization algorithms. Springer, Berlin, pp 311\u2013336","DOI":"10.1007\/978-3-642-02538-9_13"},{"issue":"13","key":"7600_CR6","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 (2020) A general corridor method-based approach for capacitated facility location. Int J Prod Res 58(13):3855\u20133880","journal-title":"Int J Prod Res"},{"key":"7600_CR7","unstructured":"Cornu\u00e9jols G, Nemhauser G, Wolsey L (1983) The uncapacitated facility location problem. Technical report, Cornell University Operations Research and Industrial Engineering"},{"key":"7600_CR8","volume-title":"Handbook of genetic algorithms","author":"LD Davis","year":"1991","unstructured":"Davis LD (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York"},{"key":"7600_CR9","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez E, Landete M (2015) Fixed-charge facility location problems. In: Location science. Springer, pp 47\u201377","DOI":"10.1007\/978-3-319-13111-5_3"},{"key":"7600_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-319-07124-4_23","volume-title":"Handbook of heuristics","author":"P Festa","year":"2018","unstructured":"Festa P, Resende MG (2018) GRASP. In: Marti R, Pardalos P, Resende M (eds) Handbook of heuristics. Springer, pp 465\u2013488"},{"issue":"3","key":"7600_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ejor.2016.03.002","volume":"253","author":"M Fischetti","year":"2016","unstructured":"Fischetti M, Ljubi\u0107 I, Sinnl M (2016) Benders decomposition without separability: a computational study for capacitated facility location problems. Eur J Oper Res 253(3):557\u2013569","journal-title":"Eur J Oper Res"},{"key":"7600_CR12","doi-asserted-by":"crossref","unstructured":"G\u00f6rtz S, Klose A (2012) A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem. INFORMS J Comput 24(4):597\u2013610","DOI":"10.1287\/ijoc.1110.0468"},{"issue":"6","key":"7600_CR13","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s10732-012-9212-8","volume":"18","author":"G Guastaroba","year":"2012","unstructured":"Guastaroba G, Speranza MG (2012) Kernel search for the capacitated facility location problem. J Heuristics 18(6):877\u2013917","journal-title":"J Heuristics"},{"key":"7600_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2014.11.004","volume":"27","author":"SC Ho","year":"2015","unstructured":"Ho SC (2015) An iterated tabu search heuristic for the single source capacitated facility location problem. Appl Soft Comput 27:169\u2013178","journal-title":"Appl Soft Comput"},{"issue":"1","key":"7600_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"A Klose","year":"2005","unstructured":"Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res 162(1):4\u201329","journal-title":"Eur J Oper Res"},{"key":"7600_CR16","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga P, Kuilpers C, Poza M et al (1997) Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms. Stat Comput 7:19\u201334","DOI":"10.1023\/A:1018553211613"},{"key":"7600_CR17","first-page":"43","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 (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"key":"7600_CR18","first-page":"320","volume-title":"Iterated local search","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2003) Iterated local search. Springer, Boston, pp 320\u2013353"},{"issue":"104","key":"7600_CR19","first-page":"995","volume":"122","author":"MRH Maia","year":"2020","unstructured":"Maia MRH, Plastino A, Penna PHV (2020) MineReduce: an approach based on data mining for problem size reduction. Comput Oper Res 122(104):995","journal-title":"Comput Oper Res"},{"key":"7600_CR20","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.cor.2018.12.018","volume":"104","author":"A Mar\u00edn","year":"2019","unstructured":"Mar\u00edn A, Pelegr\u00edn M (2019) Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience. Comput Oper Res 104:174\u2013190","journal-title":"Comput Oper Res"},{"issue":"2","key":"7600_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"MT Melo","year":"2009","unstructured":"Melo MT, Nickel S, Saldanha-Da-Gama F (2009) Facility location and supply chain management\u2014a review. Eur J Oper Res 196(2):401\u2013412","journal-title":"Eur J Oper Res"},{"key":"7600_CR22","first-page":"529","volume-title":"CP 2007, LNCS","author":"N Nethercote","year":"2007","unstructured":"Nethercote N, Stuckey PJ, Becket R et al (2007) MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re C (ed) CP 2007, LNCS, vol 4741. Springer, pp 529-543"},{"key":"7600_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.jclepro.2017.09.029","volume":"170","author":"M Rabbani","year":"2018","unstructured":"Rabbani M, Heidari R, Farrokhi-Asl H et al (2018) Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types. J Clean Prod 170:227\u2013241","journal-title":"J Clean Prod"},{"key":"7600_CR24","doi-asserted-by":"crossref","unstructured":"Rios E, Coelho IM, Ochi LS et al (2016) A benchmark on multi improvement neighborhood search strategies in CPU\/GPU systems. In: 2016 international symposium on computer architecture and high performance computing workshops (SBAC-PADW), pp 49\u201354","DOI":"10.1109\/SBAC-PADW.2016.17"},{"key":"7600_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s11590-020-01556-5","volume":"16","author":"JCN Silva","year":"2022","unstructured":"Silva JCN, Coelho IM, Souza US et al (2022) Finding the maximum multi improvement on neighborhood exploration. Optim Lett 16:97\u2013115","journal-title":"Optim Lett"},{"key":"7600_CR26","unstructured":"Urli T (2013) json2run: a tool for experiment design & analysis. CoRR arXiv:1305.1112"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07600-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07600-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07600-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T10:30:34Z","timestamp":1680085834000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07600-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,31]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["7600"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07600-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,31]]},"assertion":[{"value":"19 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}