{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:04:48Z","timestamp":1782479088369,"version":"3.54.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T00:00:00Z","timestamp":1474329600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-016-1082-9","type":"journal-article","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T11:21:45Z","timestamp":1474370505000},"page":"1371-1384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A biased random-key genetic algorithm for the tree of hubs location problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Luciana S.","family":"Pessoa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9a C.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,20]]},"reference":[{"key":"1082_CR1","unstructured":"Abreu J\u00fanior, J.\u00a0C., Noronha, T.\u00a0F., Santos, A.\u00a0C.: O problema de localiza\u00e7\u00e3o de concentradores em \u00e1rvores: um procedimento para acelerar um algoritmo baseado em decomposi\u00e7\u00e3o de Benders. In XLVII Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO), page 9p., Porto de Galinhas, Brazil (2015)"},{"key":"1082_CR2","unstructured":"Adler, N., Hashai, N.: Effect of open skies in the Middle East region. Trans. Res. Part A Policy Pract. 39(10), 878\u2013894 (2005)"},{"key":"1082_CR3","doi-asserted-by":"crossref","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. Euro. J. Operat. Res. 190, 1\u201321 (2008)","journal-title":"Euro. J. Operat. Res."},{"key":"1082_CR4","unstructured":"Beasley, J.\u00a0E.: Population heuristics. In P. M. Pardalos and M. G. C. Resende, editors, Handbook of Applied Optimization, pages 168\u2013183. Oxford University Press (2002)"},{"issue":"3","key":"1082_CR5","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.ejor.2005.08.030","volume":"179","author":"O Berman","year":"2007","unstructured":"Berman, O., Drezner, Z., Wesolowsky, G.O.: The transfer point location problem. Euro. J. Operat. Res. 179(3), 978\u2013989 (2007)","journal-title":"Euro. J. Operat. Res."},{"key":"1082_CR6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/nav.20302","volume":"55","author":"H Chen","year":"2008","unstructured":"Chen, H., Campbell, A.M., Thomas, B.W.: Network design for time-constrained delivery. Naval Res. Logist. 55, 493\u2013515 (2008)","journal-title":"Naval Res. Logist."},{"key":"1082_CR7","unstructured":"Coco, A.\u00a0A., Noronha, T.\u00a0F., Santos, A.\u00a0C.: Algoritmo baseado em BRKGA para o problema de \u00e1rvore geradora m\u00ednima robusta. In Proceedings of the XLV Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO), Natal, Brazil, pp 3658\u20133669 (2013)"},{"issue":"12","key":"1082_CR8","doi-asserted-by":"crossref","first-page":"3117","DOI":"10.1016\/j.cor.2008.12.009","volume":"36","author":"I Contreras","year":"2009","unstructured":"Contreras, I., Fern\u00e1ndez, E., Mar\u00edn, A.: Tight bounds from a path based formulation for the tree of hub location problem. Comp. Operat. Res. 36(12), 3117\u20133127 (2009)","journal-title":"Comp. Operat. Res."},{"key":"1082_CR9","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2009.05.044","volume":"2","author":"I Contreras","year":"2010","unstructured":"Contreras, I., Fern\u00e1ndez, E., Mar\u00edn, A.: The tree of hubs location problem. Euro. J. Operat. Res. 2, 390\u2013400 (2010)","journal-title":"Euro. J. Operat. Res."},{"key":"1082_CR10","doi-asserted-by":"crossref","unstructured":"Costa, T.\u00a0F. G., Lohmann, G., Oliveira, A. V. M.: A model to identify airport hubs and their importance to tourism in Brazil. Res. Trans. Econ., 26(1):3\u201311. ISSN 0739-8859. Economics of Transport for Tourism (2010)","DOI":"10.1016\/j.retrec.2009.10.002"},{"issue":"3","key":"1082_CR11","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/j.ejor.2005.03.057","volume":"179","author":"CB Cunha","year":"2007","unstructured":"Cunha, C.B., Silva, M.R.: A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. Euro. J. Operat. Res. 179(3), 747\u2013758 (2007)","journal-title":"Euro. J. Operat. Res."},{"issue":"4","key":"1082_CR12","doi-asserted-by":"crossref","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. Comp. Indust. Eng. 64(4), 1096\u20131109 (2013)","journal-title":"Comp. Indust. Eng."},{"key":"1082_CR13","doi-asserted-by":"crossref","unstructured":"D.\u00a0B. M.\u00a0M. Fontes and J.\u00a0F. Gon\u00e7alves. A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks. Optimization Letters, 7(6):1303\u20131324. ISSN 1862-4472 (2013)","DOI":"10.1007\/s11590-012-0505-5"},{"key":"1082_CR14","series-title":"Operations research proceedings","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-77903-2_20","volume-title":"Oper. Re. Procee. 2007","author":"S Gelareh","year":"2008","unstructured":"Gelareh, S., Nickel, S.: A Benders decomposition for hub location problems arising in public transport. In: Kalcsics, J\u00f6rg, Nickel, Stefan (eds.) Oper. Re. Procee. 2007. Operations research proceedings, vol. 2007, pp. 129\u2013134. Springer, Berlin Heidelberg (2008)"},{"key":"1082_CR15","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"issue":"3","key":"1082_CR16","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964)","journal-title":"Oper. Res."},{"issue":"3","key":"1082_CR17","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.ejor.2012.03.010","volume":"220","author":"R Ishfaq","year":"2012","unstructured":"Ishfaq, R., Sox, C.R.: Design of intermodal logistics networks with hub delays. Euro. J. Operat. Res. 220(3), 629\u2013641 (2012)","journal-title":"Euro. J. Operat. Res."},{"issue":"4","key":"1082_CR18","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.tre.2008.12.003","volume":"45","author":"S Limbourg","year":"2009","unstructured":"Limbourg, S., Jourquin, B.: Optimal rail-road container terminal locations on the European network. Trans. Res. Part E Logist. Trans. Rev. 45(4), 551\u2013563 (2009)","journal-title":"Trans. Res. Part E Logist. Trans. Rev."},{"key":"1082_CR19","doi-asserted-by":"crossref","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. Euro. J. Operat. Res. 32, 393\u2013404 (1987)","journal-title":"Euro. J. Operat. Res."},{"key":"1082_CR20","first-page":"120","volume":"20","author":"MGC Resende","year":"2012","unstructured":"Resende, M.G.C.: Biased random-key genetic algorithms with applications in telecommunications. TOP 20, 120\u2013153 (2012)","journal-title":"TOP"},{"key":"1082_CR21","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"MGC Resende","year":"2010","unstructured":"Resende, M.G.C., Mart\u00ed, R., Gallego, M., Duarte, A.: GRASP and path-relinking for the max-min diversity problem. Comp. Operat. Res. 37, 498\u2013508 (2010)","journal-title":"Comp. Operat. Res."},{"key":"1082_CR22","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comp. 14, 228\u2013246 (2002)","journal-title":"INFORMS J. Comp."},{"key":"1082_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.cor.2014.11.011","volume":"57","author":"E Ruiz","year":"2015","unstructured":"Ruiz, E., Albareda-Sambola, M., Fern\u00e1ndez, E., Resende, M.G.C.: A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comp. Operat. Res. 57, 95\u2013108 (2015)","journal-title":"Comp. Operat. Res."},{"issue":"2","key":"1082_CR24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.ejor.2012.10.051","volume":"226","author":"EM S\u00e1","year":"2013","unstructured":"S\u00e1, E.M., Camargo, R.S., Miranda, G.: An improved Benders decomposition algorithm for the tree of hubs location problem. Euro. J. Operat. Res. 226(2), 185\u2013202 (2013)","journal-title":"Euro. J. Operat. Res."},{"issue":"1","key":"1082_CR25","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ejor.2015.04.017","volume":"246","author":"EM S\u00e1","year":"2015","unstructured":"S\u00e1, E.M., Contreras, I., Cordeau, J.F.: Exact and heuristic algorithms for the design of hub networks with multiple lines. Euro. J. Operat. Res. 246(1), 186\u2013198 (2015)","journal-title":"Euro. J. Operat. Res."},{"key":"1082_CR26","unstructured":"Spears, W.\u00a0M., DeJong, K.\u00a0A.: On the virtues of parameterized uniform crossover. In Proceedings of the Fourth International Conference on Genetic Algorithms, pp 230\u2013236 (1991)"},{"key":"1082_CR27","doi-asserted-by":"crossref","unstructured":"Wang, J.J., Cheng, M.C.: From a hub port city to a global supply chain management center: A case study of Hong Kong. J. Trans. Geograph 18(1), 104\u2013115 (2010)","DOI":"10.1016\/j.jtrangeo.2009.02.009"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1082-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1082-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1082-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T16:15:13Z","timestamp":1568391313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1082-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,20]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1082"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1082-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,20]]}}}