{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:24Z","timestamp":1774449084136,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/04728\/2020"],"award-info":[{"award-number":["UIDB\/04728\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10472-021-09757-z","type":"journal-article","created":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T18:02:47Z","timestamp":1624644167000},"page":"799-813","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["RAMP algorithms for the capacitated facility location problem"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8301-7806","authenticated-orcid":false,"given":"Telmo","family":"Matos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3807-7292","authenticated-orcid":false,"given":"\u00d3scar","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8720-8597","authenticated-orcid":false,"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,25]]},"reference":[{"key":"9757_CR1","doi-asserted-by":"publisher","first-page":"498","DOI":"10.2307\/2273574","volume":"48","author":"HR Lewis","year":"1983","unstructured":"Lewis, H.R., \u03a0Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco 1979, x + 338 pp. J. Symb. Log. 48, 498\u2013500 (1983)","journal-title":"J. Symb. Log."},{"key":"9757_CR2","doi-asserted-by":"crossref","unstructured":"Rego, C.: RAMP: A new metaheuristic framework for combinatorial optimization. In: Rego, C. and Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search. pp. 441\u2013460. Kluwer Academic Publishers (2005)","DOI":"10.1007\/0-387-23667-8_20"},{"key":"9757_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10479-010-0800-4","volume":"181","author":"C Rego","year":"2010","unstructured":"Rego, C., Mathew, F., Glover, F.: RAMP for the capacitated minimum spanning tree problem. Ann. Oper. Res. 181, 661\u2013681 (2010)","journal-title":"Ann. Oper. Res."},{"key":"9757_CR4","unstructured":"Gamboa, D.: Adaptive memory algorithms for the solution of large scale combinatorial optimization problems, PhD Thesis (in Portuguese), (2008)"},{"key":"9757_CR5","doi-asserted-by":"crossref","unstructured":"Matos, T., Gamboa, D.: Dual-RAMP for the capacitated single allocation hub location problem. In: Computational Science and Its Applications -- ICCSA 2017: 17th International Conference, Trieste, Italy, July 3\u20136, 2017, Proceedings, Part II. pp. 696\u2013708. Springer International Publishing (2017)","DOI":"10.1007\/978-3-319-62395-5_48"},{"key":"9757_CR6","doi-asserted-by":"crossref","unstructured":"Matos, T., Maia, F., Gamboa, D.: Improving traditional dual ascent algorithm for the uncapacitated multiple allocation hub location problem: A RAMP Approach. In: The Fourth International Conference on Machine Learning, Optimization, and Data Science \u2013 September 13\u201316, 2018 \u2013 Volterra, Tuscany, Italy. pp. 243\u2013253. Springer, Italy (2019)","DOI":"10.1007\/978-3-030-13709-0_20"},{"key":"9757_CR7","doi-asserted-by":"crossref","unstructured":"Matos, T., Maia, F., Gamboa, D.: A simple dual-RAMP Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem. In: Advances in Intelligent Systems and Computing. pp. 331\u2013339. , Valencia, Spain (2020)","DOI":"10.1007\/978-3-030-14347-3_32"},{"key":"9757_CR8","doi-asserted-by":"crossref","unstructured":"Matos, T., Oliveira, \u00d3., Gamboa, D.: A simple dual-RAMP Algorithm for the Capacitated Facility Location Problem. In: Learning and Intelligent Optimization. pp. 1\u201313 (2020)","DOI":"10.1007\/978-3-030-38629-0_20"},{"key":"9757_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0377-2217(83)90195-9","volume":"12","author":"SK Jacobsen","year":"1983","unstructured":"Jacobsen, S.K.: Heuristics for the capacitated plant location model. Eur. J. Oper. Res. 12, 253\u2013261 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"9757_CR10","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"A Kuehn","year":"1963","unstructured":"Kuehn, A., Hamburger, M.: A heuristic program for locating warehouses. Manag. Sci. 9, 643\u2013666 (1963)","journal-title":"Manag. Sci."},{"key":"9757_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","volume":"50","author":"G Cornu\u00e9jols","year":"1991","unstructured":"Cornu\u00e9jols, G., Sridharan, R., Thizy, J.: A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50, 280\u2013297 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"9757_CR12","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BF01588244","volume":"17","author":"M Guignard","year":"1979","unstructured":"Guignard, M., Spielberg, K.: A direct dual method for the mixed plant location problem with some side constraints. Math. Program. 17, 198\u2013228 (1979)","journal-title":"Math. Program."},{"key":"9757_CR13","doi-asserted-by":"crossref","unstructured":"Bilde, O., Krarup, J.: Sharp lower bounds and efficient algorithms for the simple plant location problem. In: Annals of Discrete Mathematics. pp. 79\u201397 (1977)","DOI":"10.1016\/S0167-5060(08)70728-3"},{"key":"9757_CR14","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26, 992\u20131009 (1978)","journal-title":"Oper. Res."},{"key":"9757_CR15","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10732-008-9078-y","volume":"15","author":"P Avella","year":"2008","unstructured":"Avella, P., Boccia, M., Sforza, A., Vasil\u2019ev, I., Vasil\u2019ev, I.: An effective heuristic for large-scale capacitated facility location problems. J. Heuristics. 15, 597\u2013615 (2008)","journal-title":"J. Heuristics"},{"key":"9757_CR16","first-page":"133","volume":"1","author":"L Lorena","year":"1999","unstructured":"Lorena, L., Senne, E.: Improving traditional subgradient scheme for Lagrangean relaxation: an application to location problems. Int. J. Math. Algorithms. 1, 133\u2013151 (1999)","journal-title":"Int. J. Math. Algorithms."},{"key":"9757_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65, 383\u2013399 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9757_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0377-2217(95)00042-O","volume":"87","author":"R Sridharan","year":"1995","unstructured":"Sridharan, R.: The capacitated plant location problem. Eur. J. Oper. Res. 87, 203\u2013213 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9757_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/opre.34.1.145","volume":"34","author":"T Van Roy","year":"1986","unstructured":"Van Roy, T.: A cross decomposition algorithm for capacitated facility location. Eur. J. Oper. Res. 34, 145\u2013163 (1986)","journal-title":"Eur. J. Oper. Res."},{"key":"9757_CR20","doi-asserted-by":"crossref","unstructured":"Bornstein, C.T.: An ADD\/DROP procedure for the capacitated plant location problem. Pesqui. Operacional. 151\u2013162 (2003)","DOI":"10.1590\/S0101-74382004000100008"},{"key":"9757_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0966-8349(98)00062-X","volume":"6","author":"CTC Bornstein","year":"1998","unstructured":"Bornstein, C.T.C., Azlan, H.H.B.: The use of reduction tests and simulated annealing for the capacitated plant location problem. Locat. Sci. 6, 67\u201381 (1998)","journal-title":"Locat. Sci."},{"key":"9757_CR22","doi-asserted-by":"crossref","unstructured":"Lai, M.-C., Sohn, H., Tseng, T.-L. (Bill), Chiang, C.: A hybrid algorithm for capacitated plant location problem. Expert Syst. Appl. 37, 8599\u20138605 (2010)","DOI":"10.1016\/j.eswa.2010.06.104"},{"key":"9757_CR23","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"9757_CR24","doi-asserted-by":"crossref","unstructured":"Sastry, K., Goldberg, D.E., Kendall, G.: Genetic Algorithms. In: Search Methodologies. pp. 93\u2013117. Springer US, Boston, MA (2014)","DOI":"10.1007\/978-1-4614-6940-7_4"},{"key":"9757_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. (1997)"},{"key":"9757_CR26","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014part I. ORSA J. Comput. 1, 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"9757_CR27","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"134","author":"T Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 134, 109\u2013134 (1995)","journal-title":"J. Glob. Optim."},{"key":"9757_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10732-011-9157-3","volume":"18","author":"M Sun","year":"2012","unstructured":"Sun, M.: A tabu search heuristic procedure for the capacitated facility location problem. J. Heuristics. 18, 91\u2013118 (2012)","journal-title":"J. Heuristics"},{"key":"9757_CR29","unstructured":"Kennington, Jeff L. and Helgason, R. V.: Algorithms for network programming. John Wiley & Sons, Inc. (1980)"},{"key":"9757_CR30","volume-title":"Um Algoritmo GRASP H\u00edbrido para o Problema de Localiza\u00e7\u00e3o Capacitada de Custo Fixo","author":"VF Ronaldo Silva","year":"2007","unstructured":"Ronaldo Silva, V.F.: Um Algoritmo GRASP H\u00edbrido para o Problema de Localiza\u00e7\u00e3o Capacitada de Custo Fixo, (2007)"},{"key":"9757_CR31","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, M.G.: Kernel search for the capacitated facility location problem. J. Heuristics. 18, 877\u2013917 (2012)","journal-title":"J. Heuristics"},{"key":"9757_CR32","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2011.09.004","volume":"217","author":"G Guastaroba","year":"2012","unstructured":"Guastaroba, G., Speranza, M.G.: Kernel search: an application to the index tracking problem. Eur. J. Oper. Res. 217, 54\u201368 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"70\u201378","key":"9757_CR33","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2014.06.002","volume":"283","author":"A Rahmani","year":"2014","unstructured":"Rahmani, A., Mirhassani, S.A.: A hybrid firefly-genetic algorithm for the capacitated facility location problem. Inf. Sci. (Ny). 283(70\u201378), 70\u201378 (2014)","journal-title":"Inf. Sci. (Ny)."},{"key":"9757_CR34","first-page":"235","volume-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":"H Venables","year":"2008","unstructured":"Venables, H., Moscardini, A.: Ant based heuristics for the capacitated fixed charge location problem. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., St\u00fctzle, T., Winfield, A.T. (eds.) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 235\u2013242. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008)"},{"key":"9757_CR35","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1155\/2012\/954249","volume":"2012","author":"G Cabrera","year":"2012","unstructured":"Cabrera, G., Cabrera, E., Soto, R., Rubio, L.J.M., Crawford, B., Paredes, F.: A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem. Math. Probl. Eng. 2012, 14 (2012)","journal-title":"Math. Probl. Eng."},{"key":"9757_CR36","unstructured":"Levanova, T., Tkachuk, E.: Development of a bee colony optimization algorithm for the capacitated plant location problem. In: II International Conference Optimization and Applications (OPTIMA-2011). pp. 153\u2013156. , Petrovac, Montenegro (2011)"},{"key":"9757_CR37","doi-asserted-by":"crossref","unstructured":"Daskin, M.M.S.: Network and discrete location: models, algorithms, and applications. Wiley, New York. 283\u2013292 (1995)","DOI":"10.1002\/9781118032343"},{"key":"9757_CR38","doi-asserted-by":"crossref","unstructured":"Roosta, S.H.: Principles of parallel algorithm design. In: Parallel Processing and Parallel Algorithms. pp. 217\u2013258 (2000)","DOI":"10.1007\/978-1-4612-1220-1_5"},{"key":"9757_CR39","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Tangwongsan, K.: Parallel approximation algorithms for facility-location problems. Proc. 22nd ACM Symp. Parallelism algorithms Archit. SPAA 10. 315 (2010)","DOI":"10.1145\/1810479.1810535"},{"key":"9757_CR40","doi-asserted-by":"crossref","unstructured":"Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem, (2005)","DOI":"10.1287\/moor.1040.0125"},{"key":"9757_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2012.00862.x","volume":"20","author":"E Alba","year":"2013","unstructured":"Alba, E., Luque, G., Nesmachnow, S.: Parallel metaheuristics: recent advances and new trends. Int. Trans. Oper. Res. 20, 1\u201348 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"9757_CR42","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"65","author":"J Beasley","year":"1990","unstructured":"Beasley, J.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 65, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"9757_CR43","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/0377-2217(88)90175-0","volume":"33","author":"JE Beasley","year":"1988","unstructured":"Beasley, J.E.: An algorithm for solving large capacitated warehouse location problems. Eur. J. Oper. Res. 33, 314\u2013325 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"9757_CR44","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)","journal-title":"Comput. Optim. Appl."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09757-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09757-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09757-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T16:30:21Z","timestamp":1631809821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09757-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,25]]},"references-count":44,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["9757"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09757-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,25]]},"assertion":[{"value":"3 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}