{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:23Z","timestamp":1740099623012,"version":"3.37.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_20","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"240-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Simple 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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3807-7292","authenticated-orcid":false,"given":"\u00d3scar","family":"Oliveira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8720-8597","authenticated-orcid":false,"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"20_CR1","volume-title":"Discrete Network Location Models","author":"J Current","year":"2001","unstructured":"Current, J., Daskin, M., Schilling, D.: Discrete Network Location Models. Springer-Verlag, Berlin (2001)"},{"key":"20_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":"20_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":"20_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":"20_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":"20_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-5060(08)70728-3","volume-title":"Studies in Integer Programming","author":"Ole Bilde","year":"1977","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)"},{"key":"20_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":"20_CR8","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.: An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15, 597\u2013615 (2008)","journal-title":"J. Heuristics"},{"key":"20_CR9","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":"20_CR10","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":"20_CR11","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":"20_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/opre.34.1.145","volume":"34","author":"T Roy Van","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":"20_CR13","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":"20_CR14","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."},{"issue":"12","key":"20_CR15","doi-asserted-by":"publisher","first-page":"8599","DOI":"10.1016\/j.eswa.2010.06.104","volume":"37","author":"Ming-Che Lai","year":"2010","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)","journal-title":"Expert Systems with Applications"},{"key":"20_CR16","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":"20_CR17","first-page":"93","volume-title":"Search Methodologies","author":"Kumara Sastry","year":"2013","unstructured":"Sastry, K., Goldberg, D.E., Kendall, G.: Genetic algorithms. In: Search Methodologies, pp. 93\u2013117. Springer US, Boston (2014)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-1-4615-6089-0_8","volume-title":"Tabu Search","author":"Fred Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search (1997)"},{"key":"20_CR19","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":"20_CR20","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":"20_CR21","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":"20_CR22","volume-title":"Algorithms for network programming","author":"JL Kennington","year":"1980","unstructured":"Kennington, J.L., Helgason, R.V.: Algorithms for network programming. John Wiley & Sons Inc., New York (1980)"},{"key":"20_CR23","unstructured":"Ronaldo Silva, V.F.: Um Algoritmo GRASP H\u00edbrido para o Problema de Localiza\u00e7\u00e3o Capacitada de Custo Fixo, (2007)"},{"key":"20_CR24","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":"20_CR25","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."},{"key":"20_CR26","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87527-7_22"},{"key":"20_CR27","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":"20_CR28","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":"20_CR29","doi-asserted-by":"crossref","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)","DOI":"10.1007\/0-387-23667-8_20"},{"key":"20_CR30","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":"20_CR31","unstructured":"Gamboa, D.: Adaptive Memory Algorithms for the Solution of Large Scale Combinatorial Optimization Problems, Ph.D. Thesis (in Portuguese) (2008)"},{"key":"20_CR32","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, Part II. LNCS, vol. 10405, pp. 696\u2013708. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-62395-5_48"},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-13709-0_20","volume-title":"Machine Learning, Optimization, and Data Science","author":"T Matos","year":"2019","unstructured":"Matos, T., Maia, F., Gamboa, D.: Improving traditional dual ascent algorithm for the uncapacitated multiple allocation hub location problem: a RAMP approach. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R., Sciacca, V. (eds.) LOD 2018. LNCS, vol. 11331, pp. 243\u2013253. Springer, Cham (2019)"},{"key":"20_CR34","first-page":"331","volume-title":"Hybrid Intelligent Systems","author":"Telmo Matos","year":"2019","unstructured":"Matos, T., Maia, F., Gamboa, D.: A simple dual-RAMP algorithm for the uncapacitated multiple allocation hub location problem. In: 18th International Conference on Hybrid Intelligent Systems (HIS 2018) in Portugal, 2018, pp. 331\u2013339 (2020)"},{"key":"20_CR35","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032343","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"MMS Daskin","year":"1995","unstructured":"Daskin, M.M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (1995)"},{"key":"20_CR36","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":"20_CR37","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."},{"key":"20_CR38","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":"20_CR39","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10732-008-9078-y","volume":"15","author":"P Avella","year":"2006","unstructured":"Avella, P., Boccia, M., Sforza, A., Vasilev, I.: An effective heuristic for large-scale capacitated facility location problems - draft available from the authors upon request. J. Heuristics 15, 597\u2013615 (2006)","journal-title":"J. Heuristics"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:21:10Z","timestamp":1579598470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}