{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:34:45Z","timestamp":1742992485030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030932466"},{"type":"electronic","value":"9783030932473"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93247-3_49","type":"book-chapter","created":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:03:20Z","timestamp":1640822600000},"page":"495-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Effective Dual-RAMP Algorithm for the Capacitated Facility Location Problem"],"prefix":"10.1007","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":[[2022,1,1]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1057\/jors.1991.208","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)","journal-title":"J. Oper. Res. Soc."},{"key":"49_CR2","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":"49_CR3","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. Manage. Sci. 9, 643\u2013666 (1963)","journal-title":"Manage. Sci."},{"key":"49_CR4","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":"49_CR5","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":"49_CR6","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":"49_CR7","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":"49_CR8","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":"49_CR9","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":"49_CR10","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":"49_CR11","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":"8\u20139","key":"49_CR12","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10472-021-09757-z","volume":"89","author":"T Matos","year":"2021","unstructured":"Matos, T., Oliveira, \u00d3., Gamboa, D.: RAMP algorithms for the capacitated facility location problem. Ann. Math. Artif. Intell. 89(8\u20139), 799\u2013813 (2021). https:\/\/doi.org\/10.1007\/s10472-021-09757-z","journal-title":"Ann. Math. Artif. Intell."},{"key":"49_CR13","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. 283, 70\u201378 (2014)","journal-title":"Inf. Sci."},{"key":"49_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-87527-7_22","volume-title":"Ant Colony Optimization and Swarm Intelligence","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.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 235\u2013242. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87527-7_22"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1155\/2012\/954249","volume":"2012","author":"GG Cabrera","year":"2012","unstructured":"Cabrera, G.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":"49_CR16","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), Petrovac, Montenegro, pp. 153\u2013156 (2011)"},{"key":"49_CR17","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/0-387-23667-8_20","DOI":"10.1007\/0-387-23667-8_20"},{"issue":"8-9","key":"49_CR18","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10472-021-09756-0","volume":"89","author":"\u00d3 Oliveira","year":"2021","unstructured":"Oliveira, \u00d3., Matos, T., Gamboa, D.: A dual RAMP algorithm for single source capacitated facility location problems. Ann. Math. Artif. Intell. 89(8\u20139), 815\u2013834 (2021). https:\/\/doi.org\/10.1007\/s10472-021-09756-0","journal-title":"Ann. Math. Artif. Intell."},{"key":"49_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-319-62395-5_48","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2017","author":"T Matos","year":"2017","unstructured":"Matos, T., Gamboa, D.: Dual-RAMP for the capacitated single allocation hub location problem. In: Gervasi, O., et al. (eds.) ICCSA 2017. LNCS, vol. 10405, pp. 696\u2013708. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62395-5_48"},{"key":"49_CR20","doi-asserted-by":"publisher","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, Volterra, Tuscany, Italy, 13\u201316 September 2018, pp. 243\u2013253. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13709-0_20","DOI":"10.1007\/978-3-030-13709-0_20"},{"key":"49_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1590\/S0101-74382004000100008","volume":"24","author":"CT Bornstein","year":"2003","unstructured":"Bornstein, C.T.: An ADD\/DROP procedure for the capacitated plant location problem. Pesqui. Operacional. 24, 151\u2013162 (2003)","journal-title":"Pesqui. Operacional."},{"key":"49_CR22","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":"49_CR23","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":"49_CR24","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":["Lecture Notes in Networks and Systems","Intelligent Computing & Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93247-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T13:08:51Z","timestamp":1652188131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93247-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030932466","9783030932473"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93247-3_49","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing & Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hua Hin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ico2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icico.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}