{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:29Z","timestamp":1774449089565,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10472-023-09920-8","type":"journal-article","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T09:02:05Z","timestamp":1703926925000},"page":"485-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["RAMP experiments in solving the uncapacitated facility location problem"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8301-7806","authenticated-orcid":false,"given":"Telmo","family":"Matos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"9920_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27640-8","volume-title":"Location Theory","author":"S Nickel","year":"2005","unstructured":"Nickel, S.: Location Theory. Springer-Verlag, Berlin\/Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-27640-8"},{"key":"9920_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7572-0","volume-title":"Foundations of Location Analysis","author":"V Marianov","year":"2011","unstructured":"Marianov, V., Eiselt, H.A.: Foundations of Location Analysis. Springer US, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4419-7572-0"},{"key":"9920_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6","volume-title":"Facility Location: A Survey of Applications and Methods","author":"Z Drezner","year":"1995","unstructured":"Drezner, Z.: Facility Location: A Survey of Applications and Methods. Springer Verlag, New York (1995)"},{"key":"9920_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"RZ Farahani","year":"2009","unstructured":"Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Springer-Verlag, Heidelberg (2009)"},{"key":"9920_CR5","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.2307\/2582961","volume":"42","author":"S Salhi","year":"1991","unstructured":"Salhi, S., Mirchandani, P.B., Francis, R.L.: Discrete location theory. J. Oper. Res. Soc. 42, 1124 (1991). https:\/\/doi.org\/10.2307\/2582961","journal-title":"J. Oper. Res. Soc."},{"key":"9920_CR6","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/S0377-2217(03)00247-9","volume":"157","author":"L Michel","year":"2004","unstructured":"Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157, 576\u2013591 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9920_CR7","doi-asserted-by":"publisher","first-page":"2563","DOI":"10.1016\/j.cor.2005.07.014","volume":"33","author":"M Sun","year":"2006","unstructured":"Sun, M.: Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. 33, 2563\u20132589 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9920_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1018956213524","volume":"86","author":"K Al Sultan","year":"1999","unstructured":"Al Sultan, K., Al Fawzan, M.: A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. 86, 91\u2013103 (1999)","journal-title":"Ann. Oper. Res."},{"key":"9920_CR9","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":"9920_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search\u2014part II. ORSA J. Comput. 2, 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"9920_CR11","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2005.02.046","volume":"174","author":"MGC Resende","year":"2006","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174, 54\u201368 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2005.02.046","journal-title":"Eur. J. Oper. Res."},{"key":"9920_CR12","doi-asserted-by":"publisher","unstructured":"Pullan, W.: A population based hybrid meta-heuristic for the uncapacitated facility location problem. In: Proceedings of the first ACM\/SIGEVO Summit on Genetic and Evolutionary Computation - GEC \u201909. p. 475. ACM Press, New York (2009). https:\/\/doi.org\/10.1145\/1543834.1543898","DOI":"10.1145\/1543834.1543898"},{"key":"9920_CR13","doi-asserted-by":"publisher","unstructured":"Tseng, L.-Y., Wu, C.-S.: Multiple Trajectory Search for Uncapacitated Facility Location Problems. 2009 Int. Jt. Conf. Comput. Sci. Optim. 965\u2013968 (2009). https:\/\/doi.org\/10.1109\/CSO.2009.340","DOI":"10.1109\/CSO.2009.340"},{"key":"9920_CR14","doi-asserted-by":"publisher","unstructured":"Li, Q., Zhang, H., Beltran-Royo, C.: Hybrid ant colony algorithm for the uncapacitated facility location problem. Shanghai Ligong Daxue Xuebao\/Journal Univ. Shanghai Sci. Technol. 38, (2016). https:\/\/doi.org\/10.13255\/j.cnki.jusst.2016.04.011.","DOI":"10.13255\/j.cnki.jusst.2016.04.011"},{"key":"9920_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-7566-7_8","author":"S Atta","year":"2018","unstructured":"Atta, S., Mahapatra, P.R.S., Mukhopadhyay, A.: Solving uncapacitated facility location problem using monkey algorithm. Springer Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-10-7566-7_8","journal-title":"Springer Singapore"},{"key":"9920_CR16","doi-asserted-by":"publisher","first-page":"3201","DOI":"10.3233\/JIFS-169263","volume":"32","author":"K Tsuya","year":"2017","unstructured":"Tsuya, K., Takaya, M., Yamamura, A.: Application of the firefly algorithm to the uncapacitated facility location problem. J. Intell. Fuzzy Syst. 32, 3201\u20133208 (2017). https:\/\/doi.org\/10.3233\/JIFS-169263","journal-title":"J. Intell. Fuzzy Syst."},{"key":"9920_CR17","doi-asserted-by":"publisher","unstructured":"Altiparmak, F., Caliskan, E.: An ant colony optimization algorithm for the uncapacitated facility location problem. In: 38th International Conference on Computers and Industrial Engineering 2008. pp. 553\u2013560 (2008). https:\/\/doi.org\/10.15764\/aia.2014.01004","DOI":"10.15764\/aia.2014.01004"},{"key":"9920_CR18","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-030-93247-3_48","volume":"371","author":"T Matos","year":"2022","unstructured":"Matos, T.: A scatter search algorithm for the uncapacitated facility location problem. Lect. Notes Netw. Syst. 371, 488\u2013494 (2022). https:\/\/doi.org\/10.1007\/978-3-030-93247-3_48","journal-title":"Lect. Notes Netw. Syst."},{"key":"9920_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica, J., To\u0161ic, D.: Solving the simple plant location problem by genetic algorithm. RAIRO-Oper. Res. 35, 127\u2013142 (2001)","journal-title":"RAIRO-Oper. Res."},{"key":"9920_CR20","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/S0360-8352(96)00279-3","volume":"31","author":"M Gen","year":"1996","unstructured":"Gen, M., Tsujimura, Y., Ishizaki, S.: Optimal design of a star-LAN using neural networks. Comput. Ind. Eng. 31, 855\u2013859 (1996)","journal-title":"Comput. Ind. Eng."},{"key":"9920_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0377-2217(96)00047-1","volume":"93","author":"S Vaithyanathan","year":"1996","unstructured":"Vaithyanathan, S., Burke, L., Magent, M.: Massively parallel analog tabu search using neural networks applied to simple plant location problems. Eur. J. Oper. Res. 93, 317\u2013330 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9920_CR22","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":"9920_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0377-2217(90)90299-Q","volume":"46","author":"M Guignard","year":"1988","unstructured":"Guignard, M.: A Lagrangean dual ascent algorithm for simple plant location problems. Eur. J. Oper. Res. 46, 73\u201383 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"9920_CR24","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/0-387-23667-8_20","volume-title":"Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search","author":"C Rego","year":"2005","unstructured":"Rego, C.: RAMP: A new metaheuristic framework for combinatorial optimization. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pp. 441\u2013460. Kluwer Academic Publishers (2005)"},{"key":"9920_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"\u00c9D Taillard","year":"2001","unstructured":"Taillard, \u00c9.D., Gambardella, L.M., Gendreau, M., Potvin, J.-Y.Y.: Adaptive memory programming: a unified view of metaheuristics. Eur. J. Oper. Res. 135, 1\u201316 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00268-X","journal-title":"Eur. J. Oper. Res."},{"key":"9920_CR26","first-page":"652","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control. Cybern. 29, 652\u2013684 (2000)","journal-title":"Control. Cybern."},{"key":"9920_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-021-09757-z","author":"T Matos","year":"2021","unstructured":"Matos, T., Oliveira, \u00d3., Gamboa, D.: RAMP algorithms for the capacitated facility location problem. Ann. Math. Artif. Intell. (2021). https:\/\/doi.org\/10.1007\/s10472-021-09757-z","journal-title":"Ann. Math. Artif. Intell."},{"key":"9920_CR28","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-030-38629-0_20","DOI":"10.1007\/978-3-030-38629-0_20"},{"key":"9920_CR29","doi-asserted-by":"publisher","unstructured":"Oliveira, \u00d3., Matos, T., Gamboa, D.: A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location Problems. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). pp. 171\u2013183 (2020). https:\/\/doi.org\/10.1007\/978-3-030-38629-0_14","DOI":"10.1007\/978-3-030-38629-0_14"},{"key":"9920_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-0337-8","volume":"24","author":"M Laguna","year":"2003","unstructured":"Laguna, M., Marti, R.: Scatter search: Methodology and implementations in C. Oper. Res. Comput. Sci. Interfaces Ser. 24, 1\u2013283 (2003). https:\/\/doi.org\/10.1007\/978-1-4615-0337-8","journal-title":"Oper. Res. Comput. Sci. Interfaces Ser."},{"key":"9920_CR31","unstructured":"Matos, T., Gamboa, D.: A Scatter Search algorithm for the Uncapacitated Facility Location Problem. In: V Workshop on Computational Data Analysis and Numerical Methods. p. 2. Felgueiras, Portugal (2018)."},{"key":"9920_CR32","doi-asserted-by":"publisher","unstructured":"Matos, T.: RAMP for the Capacitated Single Allocation p-Hub Location Problem. In: 21th International Conference on Hybrid Intelligent Systems (HIS 2021). pp. 205\u2013214 (2022). https:\/\/doi.org\/10.1007\/978-3-030-96305-7_19.","DOI":"10.1007\/978-3-030-96305-7_19"},{"key":"9920_CR33","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-030-14347-3_32.","DOI":"10.1007\/978-3-030-14347-3_32"},{"key":"9920_CR34","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":"9920_CR35","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF02097805","volume":"18","author":"RD Galv\u00e3o","year":"1989","unstructured":"Galv\u00e3o, R.D., Raggi, L.A.: A method for solving to optimality uncapacitated location problems. Ann. Oper. Res. 18, 225\u2013244 (1989). https:\/\/doi.org\/10.1007\/BF02097805","journal-title":"Ann. Oper. Res."},{"key":"9920_CR36","unstructured":"Kochetov, Y., Ivanenko, D.: Computationally Difficult Instances for the Uncapacitated Facility Location Problem. Proofs. (2005)."},{"key":"9920_CR37","unstructured":"Institute of Mathematics. S.L. Sobolev SB RAS, http:\/\/math.nsc.ru\/AP\/benchmarks\/UFLP\/uflp.html"},{"key":"9920_CR38","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D Ghosh","year":"2003","unstructured":"Ghosh, D.: Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150, 150\u2013162 (2003). https:\/\/doi.org\/10.1016\/S0377-2217(02)00504-0","journal-title":"Eur. J. Oper. Res."},{"key":"9920_CR39","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, F.A.: Near-optimal solutions to large-scale facility location problems. Discret. Optim. 2, 35\u201350 (2005). https:\/\/doi.org\/10.1016\/j.disopt.2003.03.001","journal-title":"Discret. Optim."},{"key":"9920_CR40","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/S0167-5060(08)70728-3","DOI":"10.1016\/S0167-5060(08)70728-3"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09920-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-023-09920-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09920-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T05:16:56Z","timestamp":1713935816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-023-09920-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["9920"],"URL":"https:\/\/doi.org\/10.1007\/s10472-023-09920-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"assertion":[{"value":"21 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2023","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}