{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:36:50Z","timestamp":1780396610111,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T00:00:00Z","timestamp":1606521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T00:00:00Z","timestamp":1606521600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-020-01675-z","type":"journal-article","created":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T04:59:43Z","timestamp":1606539583000},"page":"281-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An efficient heuristic for a hub location routing problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Mustapha","family":"Ratli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dragan","family":"Uro\u0161evi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdessamad Ait","family":"El Cadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Brimberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9321-3464","authenticated-orcid":false,"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,28]]},"reference":[{"issue":"1","key":"1675_CR1","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), 1\u201321 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1675_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.2298\/YJOR180515016L","volume":"29","author":"NIL Amaldass","year":"2019","unstructured":"Amaldass, N.I.L., Lucas, C., Mladenovic, N.: Variable neighbourhood search for financial derivative problem. Yugosl. J. Oper. Res. 29(3), 359\u2013373 (2019)","journal-title":"Yugosl. J. Oper. Res."},{"key":"1675_CR3","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12801","author":"J Brimberg","year":"2020","unstructured":"Brimberg, J., Mi\u0161kovi\u0107, S., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: The uncapacitated r-allocation p-hub center problem. Int. Trans. Oper. Res. (2020). https:\/\/doi.org\/10.1111\/itor.12801","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"1675_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11590-015-0973-5","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. 11(2), 313\u2013327 (2017)","journal-title":"Optim. Lett."},{"issue":"2","key":"1675_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11590-016-1004-x","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11(2), 377\u2013388 (2017)","journal-title":"Optim. Lett."},{"key":"1675_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-019-01392-2","author":"J Brimberg","year":"2019","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: A non-triangular hub location problem. Optim. Lett. (2019). https:\/\/doi.org\/10.1007\/s11590-019-01392-2","journal-title":"Optim. Lett."},{"key":"1675_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2018","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood descent. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 341\u2013367. Springer, Cham (2018)"},{"issue":"7","key":"1675_CR8","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1016\/j.cor.2008.08.021","volume":"36","author":"AT Ernst","year":"2009","unstructured":"Ernst, A.T., Hamacher, H., Jiang, H., Krishnamoorthy, M., Woeginger, G.: Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7), 2230\u20132241 (2009)","journal-title":"Comput. Oper. Res."},{"key":"1675_CR9","first-page":"1","volume":"1","author":"AT Ernst","year":"2011","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., Baatar, H.: Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems. Work. Pap. Ser. 1, 1\u201318 (2011)","journal-title":"Work. Pap. Ser."},{"issue":"4","key":"1675_CR10","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(4), 1096\u20131109 (2013)","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"1675_CR11","doi-asserted-by":"publisher","first-page":"3136","DOI":"10.1016\/j.cor.2009.01.010","volume":"36","author":"EO Gavriliouk","year":"2009","unstructured":"Gavriliouk, E.O.: Aggregation in hub location problems. Comput. Oper. Res. 36(12), 3136\u20133142 (2009)","journal-title":"Comput. Oper. Res."},{"key":"1675_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10732-019-09406-z","volume":"26","author":"S Gelareh","year":"2020","unstructured":"Gelareh, S., Gendron, B., Hanafi, S., Monemi, R.N., Todosijevi\u0107, R.: The selective traveling salesman problem with draft limits. J. Heuristics 26, 339\u2013352 (2020)","journal-title":"J. Heuristics"},{"issue":"3","key":"1675_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"1675_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.cor.2017.05.004","volume":"86","author":"A Hoff","year":"2017","unstructured":"Hoff, A., Peir\u00f3, J., Corber\u00e1n, \u00c1., Mart\u00ed, R.: Heuristics for the capacitated modular hub location problem. Comput. Oper. Res. 86, 94\u2013109 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1675_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.cie.2012.03.014","volume":"63","author":"YH Hwang","year":"2012","unstructured":"Hwang, Y.H., Lee, Y.H.: Uncapacitated single allocation p-hub maximal covering problem. Comput. Ind. Eng. 63(2), 382\u2013389 (2012)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"1675_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","volume":"206","author":"A Ili\u0107","year":"2010","unstructured":"Ili\u0107, A., Uro\u0161evi\u0107, D., Brimberg, J., Mladenovi\u0107, N.: A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2), 289\u2013300 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"1675_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10479-017-2508-1","volume":"259","author":"O Jankovi\u0107","year":"2017","unstructured":"Jankovi\u0107, O., Mi\u0161kovi\u0107, S., Stanimirovi\u0107, Z., Todosijevi\u0107, R.: Novel formulations and vns-based heuristics for single and multiple allocation p-hub maximal covering problems. Ann. Oper. Res. 259(1\u20132), 191\u2013216 (2017)","journal-title":"Ann. Oper. Res."},{"key":"1675_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.compchemeng.2019.04.015","volume":"126","author":"P Karakostas","year":"2019","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing. Comput. Chem. Eng. 126, 263\u2013279 (2019)","journal-title":"Comput. Chem. Eng."},{"key":"1675_CR19","doi-asserted-by":"publisher","first-page":"113444","DOI":"10.1016\/j.eswa.2020.113444","volume":"153","author":"P Karakostas","year":"2020","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem. Expert Syst. Appl. 153, 113444 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"1675_CR20","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1002\/net.21685","volume":"68","author":"MC Lopes","year":"2016","unstructured":"Lopes, M.C., de Andrade, C.E., de Queiroz, T.A., Resende, M.G., Miyazawa, F.K.: Heuristics for a hub location-routing problem. Networks 68(1), 54\u201390 (2016)","journal-title":"Networks"},{"key":"1675_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.cor.2014.12.009","volume":"58","author":"R Mart\u00ed","year":"2015","unstructured":"Mart\u00ed, R., Corber\u00e1n, \u00c1., Peir\u00f3, J.: Scatter search for an uncapacitated p-hub median problem. Comput. Oper. Res. 58, 53\u201366 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"1675_CR22","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2008.07.011","volume":"36","author":"T Meyer","year":"2009","unstructured":"Meyer, T., Ernst, A.T., Krishnamoorthy, M.: A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. 36(12), 3143\u20133151 (2009)","journal-title":"Comput. Oper. Res."},{"key":"1675_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.cor.2019.05.020","volume":"110","author":"M Miki\u0107","year":"2019","unstructured":"Miki\u0107, M., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: general variable neighborhood search for the capacitated modular hub location problem. Comput. Oper. Res. 110, 101\u2013115 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1675_CR24","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/itor.12282","volume":"24","author":"A Mjirda","year":"2017","unstructured":"Mjirda, A., Todosijevi\u0107, R., Hanafi, S., Hansen, P., Mladenovi\u0107, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3), 615\u2013633 (2017)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"1675_CR25","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1111\/itor.12646","volume":"27","author":"N Mladenovi\u0107","year":"2020","unstructured":"Mladenovi\u0107, N., Alkandari, A., Pei, J., Todosijevi\u0107, R., Pardalos, P.M.: Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. Int. Trans. Oper. Res. 27(1), 480\u2013493 (2020)","journal-title":"Int. Trans. Oper. Res."},{"issue":"11","key":"1675_CR26","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(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1675_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.endm.2012.10.012","volume":"39","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: An efficient gvns for solving traveling salesman problem with time windows. Electron. Notes Discrete Math. 39, 83\u201390 (2012)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"1675_CR28","doi-asserted-by":"publisher","first-page":"19","DOI":"10.2298\/YJOR120530015M","volume":"23","author":"N Mladenovi\u0107","year":"2013","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: An efficient general variable neighborhood search for large travelling salesman problem with time windows. Yugosl. J. Oper. Res. 23(1), 19\u201330 (2013)","journal-title":"Yugosl. J. Oper. Res."},{"issue":"1","key":"1675_CR29","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.cor.2013.08.026","volume":"43","author":"J Peir\u00f3","year":"2014","unstructured":"Peir\u00f3, J., Corber\u00e1n, A., Mart\u00ed, R.: Grasp for the uncapacitated r-allocation p-hub median problem. Comput. Oper. Res. 43(1), 50\u201360 (2014)","journal-title":"Comput. Oper. Res."},{"key":"1675_CR30","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.omega.2015.01.009","volume":"54","author":"M Peker","year":"2015","unstructured":"Peker, M., Kara, B.Y.: The p-hub maximal covering problem and extensions for gradual decay functions. Omega 54, 158\u2013172 (2015)","journal-title":"Omega"},{"key":"1675_CR31","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.cie.2017.06.017","volume":"110","author":"EG Talbi","year":"2017","unstructured":"Talbi, E.G., Todosijevi\u0107, R.: The robust uncapacitated multiple allocation p-hub median problem. Comput. Ind. Eng. 110, 322\u2013332 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"1675_CR32","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1007\/s11590-014-0788-9","volume":"11","author":"R Todosijevi\u0107","year":"2017","unstructured":"Todosijevi\u0107, R., Mjirda, A., Mladenovi\u0107, M., Hanafi, S., Gendron, B.: A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11(6), 1047\u20131056 (2017)","journal-title":"Optim. Lett."},{"key":"1675_CR33","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ijepes.2015.12.031","volume":"78","author":"R Todosijevi\u0107","year":"2016","unstructured":"Todosijevi\u0107, R., Mladenovi\u0107, M., Hanafi, S., Mladenovi\u0107, N., Cr\u00e9vits, I.: Adaptive general variable neighborhood search heuristics for solving the unit commitment problem. Int. J. Electr. Power Energy Syst. 78, 873\u2013883 (2016)","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"6","key":"1675_CR34","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s11590-015-0867-6","volume":"11","author":"R Todosijevi\u0107","year":"2017","unstructured":"Todosijevi\u0107, R., Uro\u0161evi\u0107, D., Mladenovi\u0107, N., Hanafi, S.: A geneal vaiable neighbohood seach fo solving the uncapacitated r-allocation p-hub median poblem. Optim. Lett. 11(6), 1109\u20131121 (2017)","journal-title":"Optim. Lett."},{"key":"1675_CR35","doi-asserted-by":"crossref","unstructured":"Weng, K., Yang, C., Ma, Y.: Two artificial intelligence heuristics in solving multiple allocation hub maximal covering problem. In: Huang, D.S., Li, K., Irwin, G.W. (eds.) Intelligent Computing, pp. 737\u2013744. Springer, Berlin, Heidelberg (2006)","DOI":"10.1007\/11816157_90"},{"issue":"3","key":"1675_CR36","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2011.01.014","volume":"211","author":"H Yaman","year":"2011","unstructured":"Yaman, H.: Allocation strategies in hub networks. Eur. J. Oper. Res. 211(3), 442\u2013451 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01675-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01675-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01675-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:41:32Z","timestamp":1641814892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01675-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,28]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1675"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01675-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,28]]},"assertion":[{"value":"31 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}