{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:48:54Z","timestamp":1743011334755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623948"},{"type":"electronic","value":"9783319623955"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62395-5_48","type":"book-chapter","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:52:59Z","timestamp":1499302379000},"page":"696-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Dual-RAMP for the Capacitated Single Allocation Hub 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-0002-8720-8597","authenticated-orcid":false,"given":"Dorabela","family":"Gamboa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,7]]},"reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"ME O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32, 393\u2013404 (1987). doi:10.1016\/S0377-2217(87)80007-3","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00291-008-0159-y","volume":"31","author":"I Contreras","year":"2009","unstructured":"Contreras, I., D\u00edaz, J.A., Fern\u00e1ndez, E.: Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectr. 31, 483\u2013505 (2009). doi:10.1007\/s00291-008-0159-y","journal-title":"OR Spectr."},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64, 1096\u20131109 (2013). doi:10.1016\/j.cie.2013.01.012","journal-title":"Comput. Ind. Eng."},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190, 1\u201321 (2008). doi:10.1016\/j.ejor.2007.06.008","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0966-8349(96)00015-0","volume":"4","author":"ME O\u2019Kelly","year":"1996","unstructured":"O\u2019Kelly, M.E., Bryan, D., Skorin-Kapov, D., Skorin-Kapov, J.: Hub network design with single and multiple allocation: a computational study. Locat. Sci. 4, 125\u2013138 (1996). doi:10.1016\/S0966-8349(96)00015-0","journal-title":"Locat. Sci."},{"key":"48_CR6","first-page":"31","volume":"6","author":"JF Campbell","year":"1994","unstructured":"Campbell, J.F.: A survey of network hub location. Stud. Locat. Anal. 6, 31\u201349 (1994)","journal-title":"Stud. Locat. Anal."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Lawler, E., Wood, D.: Branch-and-bound methods: a survey. Oper. Res. 14, 699\u2013719 (1966). doi:http:\/\/dx.doi.org\/10.1287\/opre.14.4.699","DOI":"10.1287\/opre.14.4.699"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst, A.T., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86, 141\u2013159 (1999). doi:10.1023\/A:1018994432663","journal-title":"Ann. Oper. Res."},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ejor.2010.04.015","volume":"207","author":"I Correia","year":"2010","unstructured":"Correia, I., Nickel, S., Saldanha-da-Gama, F.: The capacitated single-allocation hub location problem revisited: a note on a classical formulation. Eur. J. Oper. Res. 207, 92\u201396 (2010). doi:10.1016\/j.ejor.2010.04.015","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-004-0531-x","volume":"102","author":"M Labb\u00e9","year":"2005","unstructured":"Labb\u00e9, M., Yaman, H., Gourdin, E.: A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102, 371\u2013405 (2005). doi:10.1007\/s10107-004-0531-x","journal-title":"Math. Program."},{"key":"48_CR11","doi-asserted-by":"publisher","unstructured":"da Gra\u00e7a Costa, M., Captivo, M.E., Cl\u00edmaco, J.: Capacitated single allocation hub location problem-A bi-criteria approach. Comput. Oper. Res. 35, 3671\u20133695 (2008). doi:10.1016\/j.cor.2007.04.005","DOI":"10.1016\/j.cor.2007.04.005"},{"key":"48_CR12","unstructured":"Almeida, W.G., Yanasse, H.H., Senne, E.L.F.: Uma abordagem exata para problema de localiza\u00e7\u00e3o de concentradores capacitado. In: 43 Simp\u00f3sio Bras. Pesqui. Operacional, pp. 2192\u20132203 (2011)"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1142\/9789812709691_0055","volume":"1","author":"P Stanojevi\u0107","year":"2014","unstructured":"Stanojevi\u0107, P., Mari\u0107, M.: Solving large scale instances of hub location problems with a sub-problem using an exact method. IPSI BgD Trans. Internet Res. 1, 6 (2014). doi:10.1142\/9789812709691_0055","journal-title":"IPSI BgD Trans. Internet Res."},{"key":"48_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0305-0483(94)90006-X","volume":"22","author":"C Koulamas","year":"1994","unstructured":"Koulamas, C., Antony, S., Jaen, R.: A survey of simulated annealing applications to operations research problems. Omega 22, 41\u201356 (1994). doi:10.1016\/0305-0483(94)90006-X","journal-title":"Omega"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Stanimirovi\u0107, Z.: Solving the capacitated single allocation hub location problem using genetic algorithm. In: Recent Advances in Stochastic Modelling and Data Analysis, pp. 464\u2013471. World Scientific (2007)","DOI":"10.1142\/9789812709691_0055"},{"key":"48_CR16","unstructured":"Almeida, W., Senne, E.L.F., Yanasse, H.: Abordagens meta-heur\u00edsticas para o problema de localiza\u00e7\u00e3o de concentradores com restri\u00e7\u00f5es de capacidade. In: X Worcap, p. 12 (2010)"},{"key":"48_CR17","unstructured":"Baker, J.: Adaptive selection methods for genetic algorithms. In: Proceedings 1st International Conference Genetic Algorithms, pp. 101\u2013111 (1985)"},{"key":"48_CR18","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/0-306-48056-5_9","volume-title":"Handbook Metaheuristics","author":"T St\u00fctzle","year":"2003","unstructured":"St\u00fctzle, T., Dorigo, M.: The ant colony optimization metaheuristic: algorithms, applications and advances. In: Glover, F., Kochenberger, G.A. (eds.) Handbook Metaheuristics, vol. 57, pp. 250\u2013285. Springer, New York (2003)"},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10589-007-9069-1","volume":"39","author":"M Randall","year":"2008","unstructured":"Randall, M.: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation. Comput. Optim. Appl. 39, 239\u2013261 (2008). doi:10.1007\/s10589-007-9069-1","journal-title":"Comput. Optim. Appl."},{"key":"48_CR20","doi-asserted-by":"crossref","first-page":"343","DOI":"10.55630\/sjc.2013.7.343-354","volume":"7","author":"M Mari\u0107","year":"2013","unstructured":"Mari\u0107, M.: Variable neighborhood search for solving the capacitated single allocation hub location problem. Serdica J. Comput. 7, 343\u2013354 (2013)","journal-title":"Serdica J. Comput."},{"key":"48_CR21","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997). doi:10.1016\/S0305-0548(97)00031-2","journal-title":"Comput. Oper. Res."},{"key":"48_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.asoc.2015.04.018","volume":"33","author":"P Stanojevi\u0107","year":"2015","unstructured":"Stanojevi\u0107, P., Mari\u0107, M., Stanimirovi\u0107, Z.: A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem. Appl. Soft Comput. 33, 24\u201336 (2015). doi:10.1016\/j.asoc.2015.04.018","journal-title":"Appl. Soft Comput."},{"key":"48_CR23","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, New York (2005)","DOI":"10.1007\/0-387-23667-8_20"},{"key":"48_CR24","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). doi:10.1007\/s10479-010-0800-4","journal-title":"Ann. Oper. Res."},{"key":"48_CR25","unstructured":"Gamboa, D.: Adaptive memory algorithms for the solution of large scale combinatorial optimization problems. Ph.D. thesis (in portuguese). Instituto Superior T\u00e9cnico, Universidade T\u00e9cnica de Lisboa (2008)"},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Riley, C., Rego, C., Li, H.: A simple dual-RAMP algorithm for resource constraint project scheduling. In: ACM Southeast Region Conference, p. 67 (2010)","DOI":"10.1145\/1900008.1900097"},{"key":"48_CR27","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Toth, P., et al.: New trends in exact algorithms for the 0\u20131 knapsack problem. Eur. J. Oper. Res. 123, 325\u2013332 (2000). doi:10.1016\/S0377-2217(99)00260-X","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR28","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."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62395-5_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:29:51Z","timestamp":1710332991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62395-5_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623948","9783319623955"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62395-5_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}