{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:29Z","timestamp":1740099629219,"version":"3.37.3"},"publisher-location":"Cham","reference-count":34,"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_14","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"171-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3807-7292","authenticated-orcid":false,"given":"\u00d3scar","family":"Oliveira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8301-7806","authenticated-orcid":false,"given":"Telmo","family":"Matos","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":"14_CR1","doi-asserted-by":"crossref","unstructured":"Current, J., Daskin, M.S., Schilling, D.: Discrete network location models. In: Drezner, Z., Hamacher, H. (eds.) Facility Location; Applications and Theory, pp. 83\u2013120 (2001)","DOI":"10.1007\/978-3-642-56082-8_3"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/0-387-23667-8_20","volume-title":"Metaheuristic Optimization via Memory and Evolution","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, pp. 441\u2013460. Kluwer Academic Publishers, Boston (2005)"},{"key":"14_CR3","unstructured":"Gamboa, D.: Adaptive Memory Algorithms for the Solution of Large Scale Combinatorial Optimization Problems. PhD Thesis, Instituto Superior T\u00e9cnico, Universidade T\u00e9cnica de Lisboa (2008). (in Portuguese)"},{"key":"14_CR4","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":"14_CR5","doi-asserted-by":"crossref","unstructured":"Matos, T., Gamboa, D.: Dual-RAMP for the capacitated single allocation p-hub location problem. In: 47th International Conference on Computers & Industrial Engineering 2017 (CIE47): How Digital Platforms and Industrial Engineering are Transforming Industry and Services, pp. 696\u2013708. Computers and Industrial Engineering, Lisboa (2017)","DOI":"10.1007\/978-3-319-62395-5_48"},{"key":"14_CR6","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-62395-5_48"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-13709-0_20","volume-title":"The Fourth International Conference on Machine Learning, Optimization, and Data Science, Volterra, Tuscany, Italy, 13\u201316 September 2018","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.) The Fourth International Conference on Machine Learning, Optimization, and Data Science, Volterra, Tuscany, Italy, 13\u201316 September 2018, pp. 243\u2013253. Springer, Italy (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-13709-0_20"},{"key":"14_CR8","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-030-14347-3_32","volume-title":"Hybrid Intelligent Systems","author":"T Matos","year":"2020","unstructured":"Matos, T., Maia, F., Gamboa, D.: A simple dual-RAMP algorithm for the uncapacitated multiple allocation hub location problem. In: Madureira, A.M., Abraham, A., Gandhi, N., Varela, M.L. (eds.) HIS 2018. AISC, vol. 923, pp. 331\u2013339. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-14347-3_32"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1057\/jors.1983.242","volume":"34","author":"AW Neebe","year":"1983","unstructured":"Neebe, A.W., Rao, M.R.: an algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. 34, 1107\u20131113 (1983)","journal-title":"J. Oper. Res. Soc."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","volume":"15","author":"J Barcel\u00f3","year":"1984","unstructured":"Barcel\u00f3, J., Casanovas, J.: A heuristic Lagrangian relaxation algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15, 212\u2013226 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"JG Klincewicz","year":"1986","unstructured":"Klincewicz, J.G., Luss, H.: A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37, 495\u2013500 (1986)","journal-title":"J. Oper. Res. Soc."},{"key":"14_CR12","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":"14_CR13","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1057\/jors.1991.117","volume":"42","author":"R Sridharan","year":"1991","unstructured":"Sridharan, R.: A Lagrangian heuristic for the capacitated plant location problem with side constraints. J. Oper. Res. Soc. 42, 579\u2013585 (1991)","journal-title":"J. Oper. Res. Soc."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"14","author":"H Pirkul","year":"1987","unstructured":"Pirkul, H.: Efficient algorithms for the capacitated concentrator location problem. Comput. Oper. Res. 14, 197\u2013208 (1987)","journal-title":"Comput. Oper. Res."},{"key":"14_CR15","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":"14_CR16","first-page":"217","volume":"8","author":"H Delmaire","year":"1997","unstructured":"Delmaire, H., D\u00edaz, J.A., Fern\u00e1ndez, E., Ortega, M.: Comparing new heuristics for the pure integer capacitated plant location problem. Invest. Oper. 8, 217\u2013242 (1997)","journal-title":"Invest. Oper."},{"key":"14_CR17","first-page":"194","volume":"37","author":"H Delmaire","year":"1999","unstructured":"Delmaire, H., D\u00edaz, J.A., Fern\u00e1ndez, E., Ortega, M.: Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR Inf. Syst. Oper. Res. 37, 194\u2013225 (1999)","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0377-2217(98)00045-9","volume":"116","author":"M R\u00f6nnqvist","year":"1999","unstructured":"R\u00f6nnqvist, M., Tragantalerngsak, S., Holt, J.: A repeated matching heuristic for the single-source capacitated facility location problem. Eur. J. Oper. Res. 116, 51\u201368 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K Holmberg","year":"1999","unstructured":"Holmberg, K., R\u00f6nnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113, 544\u2013559 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1057\/palgrave.jors.2600698","volume":"50","author":"KS Hindi","year":"1999","unstructured":"Hindi, K.S., Pienkosz, K.: Efficient solution of large scale, single-source, capacitated plant location problems. J. Oper. Soc. 50, 268\u2013274 (1999)","journal-title":"J. Oper. Soc."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"RK Ahuja","year":"2004","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutell\u00e0, M.G.: A multi-exchange heuristic for the single-source capacitated facility location problem. Manage. Sci. 50, 749\u2013760 (2004)","journal-title":"Manage. Sci."},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(02)00829-9","volume":"151","author":"MJ Cortinhal","year":"2003","unstructured":"Cortinhal, M.J., Captivo, M.E.: Upper and lower bounds for the single source capacitated location problem. Eur. J. Oper. Res. 151, 333\u2013351 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR23","first-page":"187","volume-title":"Applied Optimization","author":"Maria Jo\u00e3o Cortinhal","year":"2003","unstructured":"Cortinhal, M.J., Captivo, M.E.: Genetic algorithms for the single source capacitated location problem. In: Metaheuristics: Computer Decision-Making, vol. 151, pp. 333\u2013351 (2003)"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10479-007-0193-1","volume":"157","author":"IA Contreras","year":"2007","unstructured":"Contreras, I.A., D\u00edaz, J.A.: Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157, 73\u201389 (2007)","journal-title":"Ann. Oper. Res."},{"key":"14_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search","author":"M Laguna","year":"2003","unstructured":"Laguna, M., Marti, R.: Scatter Search. Springer, New York (2003). \nhttps:\/\/doi.org\/10.1007\/978-1-4615-0337-8"},{"key":"14_CR26","first-page":"28","volume":"12","author":"K Kumweang","year":"2005","unstructured":"Kumweang, K., Kawtummachai, R.: Solving a SSCFLP in a supply chain with ACO. Suranaree J. Sci. 12, 28\u201338 (2005)","journal-title":"Suranaree J. Sci."},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.tre.2007.09.001","volume":"44","author":"C-H Chen","year":"2008","unstructured":"Chen, C.-H., Ting, C.-J.: Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem. Transp. Res. Part E Logistics Transp. Rev. 44, 1099\u20131122 (2008)","journal-title":"Transp. Res. Part E Logistics Transp. Rev."},{"key":"14_CR28","first-page":"1920","volume":"11","author":"Y Lina","year":"2011","unstructured":"Lina, Y., Xu, S.U.N., Tianhe, C.H.I.: A hybrid ant colony optimization algorithm with local search strategies to solve single source capacitated facility location problem. Eng. Technol. 11, 1920\u20131924 (2011)","journal-title":"Eng. Technol."},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2012.03.047","volume":"221","author":"Z Yang","year":"2012","unstructured":"Yang, Z., Chu, F., Chen, H.: A cut-and-solve based algorithm for the single-source capacitated facility location problem. Eur. J. Oper. Res. 221, 521\u2013532 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.artint.2006.02.005","volume":"170","author":"S Climer","year":"2006","unstructured":"Climer, S., Zhang, W.: Cut-and-solve: an iterative search strategy for combinatorial optimization problems. Artif. Intell. 170, 714\u2013738 (2006)","journal-title":"Artif. Intell."},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2014.04.007","volume":"238","author":"G Guastaroba","year":"2014","unstructured":"Guastaroba, G., Speranza, M.G.: A heuristic for BILP problems: the Single Source Capacitated Facility Location Problem. Eur. J. Oper. Res. 238, 438\u2013450 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2014.11.004","volume":"27","author":"SC Ho","year":"2015","unstructured":"Ho, S.C.: An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem. Appl. Soft Comput. 27, 169\u2013178 (2015)","journal-title":"Appl. Soft Comput."},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Manage. Sci. 45, 414\u2013425 (1999)","journal-title":"Manage. Sci."},{"key":"14_CR34","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 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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:21:02Z","timestamp":1579598462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_14","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)"}}]}}