{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:27:59Z","timestamp":1770748079169,"version":"3.49.0"},"reference-count":28,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T00:00:00Z","timestamp":1652745600000},"content-version":"vor","delay-in-days":16,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["303594\/2018-7"],"award-info":[{"award-number":["303594\/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":["309755\/2021-2"],"award-info":[{"award-number":["309755\/2021-2"]}],"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":["407151\/2021-4"],"award-info":[{"award-number":["407151\/2021-4"]}],"id":[{"id":"10.13039\/501100003593","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":"crossref","award":["Finance Code 001."],"award-info":[{"award-number":["Finance Code 001."]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,3,23]]},"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:p>The capacitated clustering problem is a well-known and largely studied combinatorial optimization problem with several industrial applications. Although a great attention has been paid to this problem in the literature, the deeming of the problem with clusters centers with multiple types and a unique capacity per type is quite limited. We introduce a novel variant of capacitated clustering problems named multi-capacitated clustering problem (MCCP), a NP-hard optimization problem in which there are clients with different types and units of services to offer that must be grouped into given centers that demand with limited capacity per type the services. It is taken into account the distance between each one of these clients and the potential clusters to which they can be allocated, aiming to minimize the sum of such distances. It is presented an integer programming model for this problem, which it is shown to have limited application solving large-sized instances. As solution procedures, we present the following algorithms. We propose a greedy heuristic to generate a tentative feasible solution within a negligible computational effort. We adapt a size-reduction (SR) matheuristic to solve the problem under study. Furthermore, we introduce an innovative matheuristic that hybridizes the constructive phase of the well-known GRASP metaheuristic with the SR algorithm. Also, we develop a variable fixing (VF) heuristic. Finally, we propose a hybrid matheuristic based on the SR and VF algorithms. Computational results over a set of 100 randomly generated test instances point out the quality of the solutions found by the proposed algorithms. Besides, the results are statistically tested, and thus, our proposals are recommended to solve the problem under study.<\/jats:p>","DOI":"10.1051\/ro\/2022048","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T19:54:33Z","timestamp":1648238073000},"page":"1167-1185","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid matheuristics for the multi-capacitated clustering problem"],"prefix":"10.1051","volume":"56","author":[{"given":"Kennedy Anderson Gumar\u00e3es","family":"de Ara\u00fajo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jedson Bernadino","family":"Guedes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3920-089X","authenticated-orcid":false,"given":"Bruno de Athayde","family":"Prata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2022,5,17]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2003.08.066","volume":"162","author":"Ahmadi","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"R2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10479-017-2601-5","volume":"272","author":"Brimberg","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Chagas G.O., Lorena L.A.N. and dos Santos R.D.C., A hybrid heuristic for the overlapping cluster editing problem. Appl. Soft Comput. (2019) 105\u2013482.","DOI":"10.1016\/j.asoc.2019.105482"},{"key":"R4","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.cor.2008.09.011","volume":"37","author":"Chaves","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"5013","DOI":"10.1016\/j.eswa.2010.09.149","volume":"38","author":"Chaves","year":"2011","journal-title":"Exp. Syst. App."},{"key":"R6","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.cie.2018.07.031","volume":"124","author":"Chaves","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"R7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s11590-020-01577-0","volume":"15","author":"Dauer","year":"2021","journal-title":"Optim. Lett."},{"key":"R8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10732-010-9129-z","volume":"17","author":"Deng","year":"2011","journal-title":"J. Heuristics"},{"key":"R9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.cor.2010.05.005","volume":"38","author":"Fanjul-Peyro","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"Feo","year":"1995","journal-title":"J. Glob. Optim."},{"key":"R11","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1111\/j.1475-3995.1999.tb00180.x","volume":"6","author":"Fran\u00e7a","year":"1999","journal-title":"Int. Trans. Oper. Res."},{"key":"R12","unstructured":"Garey M.R. and Johnson D.S., Computers and Intractability. Vol 174. Freeman, San Francisco (1979)."},{"key":"R13","first-page":"52","volume":"8","author":"Geetha","year":"2009","journal-title":"INFOCOMP J. Comput. Sci."},{"key":"R14","doi-asserted-by":"crossref","first-page":"105304","DOI":"10.1016\/j.cor.2021.105304","volume":"132","author":"Gn\u00e4gi","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.engappai.2016.08.004","volume":"56","author":"Lai","year":"2016","journal-title":"Eng. App. Artif. Intell."},{"key":"R16","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/j.ejor.2018.04.048","volume":"271","author":"Mai","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ins.2017.06.041","volume":"417","author":"Martnez-Gavara","year":"2017","journal-title":"Inf. Sci."},{"key":"R18","unstructured":"Montgomery D.C., Design and Analysis of Experiments. John Wiley & Sons (2017)."},{"key":"R19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","volume":"18","author":"Mulvey","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1016\/j.cor.2004.11.011","volume":"33","author":"Negreiros","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Negreiros M.J., Maculan N., Batista P.L., Rodrigues J.A. and Palhano A.W.C., Capacitated clustering problems applied to the layout of it-teams in software factories. Ann. Oper. Res. (2020) 1\u201329.","DOI":"10.1007\/s10479-020-03785-4"},{"key":"R22","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"1","author":"Osman","year":"1994","journal-title":"Int. Trans. Oper. Res."},{"key":"R23","unstructured":"Prata B.A., The multi capacitated clustering problem. Technical report, Federal University of Cear\u00e1, Brazil (2015)."},{"key":"R24","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.ejor.2004.08.014","volume":"169","author":"Scheuerer","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"R25","first-page":"1","volume":"18","author":"Shieh","year":"2001","journal-title":"J. Chin. Inst. Ind. Eng."},{"key":"R26","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1111\/itor.12103","volume":"22","author":"Stefanello","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"key":"R27","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.cie.2010.07.021","volume":"61","author":"Yang","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"R28","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.ejor.2018.08.043","volume":"273","author":"Zhou","year":"2019","journal-title":"Eur. J. Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022048\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T07:57:57Z","timestamp":1652774277000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":28,"journal-issue":{"issue":"3"},"alternative-id":["ro210236"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022048","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5]]}}}