{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T15:04:44Z","timestamp":1761491084428,"version":"3.37.3"},"reference-count":52,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:00:00Z","timestamp":1614643200000},"content-version":"vor","delay-in-days":60,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2020,10,31]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein <jats:italic>runaway<\/jats:italic> nodes and <jats:italic>runaway connections<\/jats:italic> with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.<\/jats:p>","DOI":"10.1051\/ro\/2020125","type":"journal-article","created":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T20:00:10Z","timestamp":1604433610000},"page":"S2831-S2858","source":"Crossref","is-referenced-by-count":6,"special_numbering":"Supplement","title":["Hub location problem in round-trip service applications"],"prefix":"10.1051","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7203-7134","authenticated-orcid":false,"given":"Omar","family":"Kemmar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Bouamrane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahin","family":"Gelareh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,3,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1016\/j.tre.2012.04.001","volume":"48","author":"Alumur","year":"2012","journal-title":"Transp. Res. Part E: Logistics Transp. Rev"},{"key":"R2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10479-017-2517-0","volume":"272","author":"Azizi","year":"2019","journal-title":"Ann. Oper. Res"},{"key":"R3","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.ejor.2005.08.030","volume":"179","author":"Berman","year":"2007","journal-title":"Eur. J. Oper. Res"},{"key":"R4","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"Burke","year":"2013","journal-title":"J. Oper. Res. Soc"},{"key":"R5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02060471","volume":"40","author":"Campbell","year":"1992","journal-title":"Ann. Oper. Res"},{"key":"R6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"Campbell","year":"1994","journal-title":"Eur. J. Oper. Res"},{"key":"R7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.omega.2015.03.008","volume":"56","author":"Cardoso","year":"2015","journal-title":"Omega"},{"key":"R8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1002\/net.20020","volume":"44","author":"Carello","year":"2004","journal-title":"Networks"},{"key":"R9","unstructured":"Carroll P., Fortz B., Labb\u00e9 M. and McGarraghy S., Improved formulations for the ring spur assignment problem, in Network Optimization. INOC 2011, edited by Pahl J., Reiners T. and Vo\u00df S.. Vol. 6701 of Lecture Notes in Computer Science. Springer, Berlin-Heidelberg (2011) 24\u201336."},{"key":"R10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10479-010-0705-2","volume":"181","author":"\u00c7etiner","year":"2010","journal-title":"Ann. Oper. Res"},{"key":"R11","first-page":"191","volume":"8","author":"Chaharsooghi","year":"2016","journal-title":"Int. J. Ind. Eng. Comput"},{"key":"R12","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s10479-015-2091-2","volume":"258","author":"Contreras","year":"2017","journal-title":"Ann. Oper. Res"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Cowling P.I., Kendall G. and Soubeiga E., A hyperheuristic approach to scheduling a sales summit. In: Practice and Theory of Automated Timetabling III, PATAT \u201900. Springer (2001) 176\u2013190.","DOI":"10.1007\/3-540-44629-X_11"},{"key":"R14","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.cor.2018.09.011","volume":"104","author":"Dai","year":"2019","journal-title":"Comput. Oper. Res"},{"key":"R15","unstructured":"Danach K., Hyperheuristics in Logistics. Ph.D. thesis, Ecole Centrale de Lille (2016)."},{"key":"R16","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s13676-019-00141-w","volume":"8","author":"Danach","year":"2019","journal-title":"EURO J. Transp. Logistics"},{"key":"R17","unstructured":"Denzinger J. and Fuchs M., High performance ATP systems by combining several AI methods. In: Vol. 1 of IJCAI\u201997. Proceedings of the 15th International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers Inc. (1997) 102\u2013107."},{"key":"R18","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0377-2217(98)00395-6","volume":"120","author":"Ebery","year":"2000","journal-title":"Eur. J. Oper. Res"},{"key":"R19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"Ernst","year":"1996","journal-title":"Location Sci"},{"key":"R20","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.tre.2011.04.009","volume":"47","author":"Gelareh","year":"2011","journal-title":"Transp. Res. Part E: Logistics Transp. Rev"},{"key":"R21","doi-asserted-by":"crossref","first-page":"3307","DOI":"10.1016\/j.apm.2012.07.017","volume":"37","author":"Gelareh","year":"2013","journal-title":"Appl. Math. Model"},{"key":"R22","unstructured":"Gelareh S., Neamatian Monemic R. and Semet F., Capacitated bounded cardinality hub routing problem: model and solution algorithm. Technical report Preprint arXiv:1705.07985 (2017)."},{"key":"R23","unstructured":"He Z., Farthest-point heuristic based initialization methods for k-modes clustering. CoRR, abs\/cs\/0610043 (2006)."},{"key":"R24","first-page":"706","volume":"14","author":"Huang","year":"2018","journal-title":"Transp. A: Transp. Sci"},{"key":"R25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.cor.2012.05.009","volume":"40","author":"Jarboui","year":"2013","journal-title":"Comput. Oper. Res"},{"key":"R26","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1111\/j.1538-4632.2009.00755.x","volume":"41","author":"Kim","year":"2009","journal-title":"Geogr. Anal"},{"key":"R27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0191-2615(93)90008-X","volume":"27","author":"Kuby","year":"1993","journal-title":"Transp. Res. Part A: Policy Practice"},{"key":"R28","unstructured":"MacQueen J.B., Some methods for classification and analysis of multivariate observations. In: Vol. 1 of Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability. University of California Press (1967) 281\u2013297."},{"key":"R29","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ejor.2015.04.017","volume":"246","author":"Martins de S\u00e1","year":"2015","journal-title":"Eur. J. Oper. Res"},{"key":"R30","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1287\/trsc.2014.0576","volume":"49","author":"Martins de S\u00e1","year":"2015","journal-title":"Transp. Sci"},{"key":"R31","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res"},{"key":"R32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.engappai.2015.12.009","volume":"50","author":"Mohammadi","year":"2016","journal-title":"Eng. App. Artif. Intel"},{"key":"R33","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.cor.2017.06.016","volume":"88","author":"Monemi","year":"2017","journal-title":"Comput. Oper. Res"},{"key":"R34","first-page":"374","volume":"9","author":"Mourelo Ferrandez","year":"2016","journal-title":"J. Ind. Eng. Manage"},{"key":"R35","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01434269","volume":"71","author":"O\u2019Kelly","year":"1992","journal-title":"Papers Regional Sci"},{"key":"R36","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02060486","volume":"40","author":"O\u2019Kelly","year":"1993","journal-title":"Ann. Oper. Res"},{"key":"R37","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/imaman\/dpm013","volume":"18","author":"P\u00e9rez","year":"2007","journal-title":"IMA J. Manage. Math"},{"key":"R38","doi-asserted-by":"crossref","unstructured":"P\u00e9rez-Ortega J., Nelva N.A.-O., Vega-Villalobos A., Pazos-Rangel R., Zavala-Diaz C. and Martinez-Rebollar A., The K-means algorithm evolution, edited by Sud K., Erdogmus P. and Kadry S.. In: Introduction to Data Science and Machine Learning. IntechOpen, Rijeka (2020).","DOI":"10.5772\/intechopen.85447"},{"key":"R39","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s00170-013-5602-9","volume":"72","author":"Rahmaniani","year":"2014","journal-title":"Int. J. Adv. Manuf. Technol"},{"key":"R40","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cor.2014.04.014","volume":"50","author":"Rodriguez-Martin","year":"2014","journal-title":"Comput. Oper. Res"},{"key":"R41","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/net.21687","volume":"68","author":"Rodriguez-Martin","year":"2016","journal-title":"Networks"},{"key":"R42","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cor.2018.04.002","volume":"96","author":"Rostami","year":"2018","journal-title":"Comput. Oper. Res"},{"key":"R43","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.trb.2016.01.011","volume":"86","author":"Serper","year":"2016","journal-title":"Transp. Res. Part B: Methodol"},{"key":"R44","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","volume":"94","author":"Skorin-Kapov","year":"1996","journal-title":"Eur. J. Oper. Res"},{"key":"R45","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1007\/s11590-015-0867-6","volume":"11","author":"Todosijevi\u0107","year":"2017","journal-title":"Optim. Lett"},{"key":"R46","unstructured":"UNCTAD, Review of maritime transport. In: United Nations Conference on Trade and Development, New York and Geneva (2018)."},{"key":"R47","first-page":"1205","volume":"27","author":"Yahyaei","year":"2014","journal-title":"Int. J. Eng. Trans. B: App"},{"key":"R48","doi-asserted-by":"crossref","first-page":"105561","DOI":"10.1016\/j.asoc.2019.105561","volume":"82","author":"Yahyaei","year":"2019","journal-title":"Appl. Soft Comput"},{"key":"R49","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.trb.2007.03.003","volume":"41","author":"Yaman","year":"2007","journal-title":"Transp. Res. Part B: Methodol"},{"key":"R50","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.cie.2012.09.006","volume":"64","author":"Yang","year":"2013","journal-title":"Comput. Ind. Eng"},{"key":"R51","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.tre.2017.11.001","volume":"109","author":"Zhalechian","year":"2018","journal-title":"Transp. Res. Part E: Logistics Transp. Rev"},{"key":"R52","doi-asserted-by":"crossref","unstructured":"Zhong W., Juan Z., Zong F. and Su H., Hierarchical hub location model and hybrid algorithm for integration of urban and rural public transport. Int. J. Distr. Sensor Netw. 14 (2018).","DOI":"10.1177\/1550147718773263"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020125\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T09:36:16Z","timestamp":1614677776000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":52,"alternative-id":["ro200064"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2020125","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2021]]}}}