{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T05:20:04Z","timestamp":1771305604396,"version":"3.50.1"},"reference-count":57,"publisher":"EDP Sciences","issue":"5","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":61,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,9,28]]},"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p>This paper aims to develop a mathematical model for rapid transit networks based on a hub and spoke model, comprising stopovers (stations) in the hub and non-hub (spoke) alignments. Due to the use of rapid transit systems in both the hub-level sub-network (<jats:italic>i.e<\/jats:italic>., the network among the hub nodes) and the spoke-level sub-network (<jats:italic>i.e<\/jats:italic>., the network which connect the spoke nodes to each other and to the hub nodes), the proposed model relaxes some of the usual assumptions in classical hub location models. In the proposed model, the transshipment of flows among the spoke nodes is possible, the setup costs of all the hub and spoke nodes and edges are considerable, and both hub and spoke edges have capacity constraints. In addition to the network infrastructure designed through decisions about the locations of the hub and spoke nodes and edges, the hub and spoke rapid transit lines are determined along with the routes of demands in those lines. The model incorporates profit and service time criteria. An adaptive large neighborhood search solution algorithm is developed whose efficiency is proved by the computational results. Some managerial insight is also provided through the analysis of the resulting networks under various parameter settings.<\/jats:p>","DOI":"10.1051\/ro\/2022170","type":"journal-article","created":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T18:58:46Z","timestamp":1664737126000},"page":"3733-3763","source":"Crossref","is-referenced-by-count":10,"title":["Mathematical modeling of a bi-objective hub location-routing problem for rapid transit networks"],"prefix":"10.1051","volume":"56","author":[{"given":"Malihe","family":"Fallah-Tafti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4429-6379","authenticated-orcid":false,"given":"Mahboobeh","family":"Honarvar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Tavakkoli-Moghaddam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad","family":"Sadegheih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2022,11,1]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"Ahuja","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"R2","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.tre.2016.09.008","volume":"96","author":"Alibeyg","year":"2016","journal-title":"Transp. Res. E Logist. Transp. Rev."},{"key":"R3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0377-2217(94)90062-0","volume":"79","author":"Aykin","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"13267","DOI":"10.1007\/s00521-019-04666-z","volume":"32","author":"Basirati","year":"2020","journal-title":"Neural. Comput. Appl."},{"key":"R5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0377-2217(97)00187-2","volume":"104","author":"Bruno","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"R6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s10479-015-1999-x","volume":"258","author":"Cadarso","year":"2017","journal-title":"Ann. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1287\/mnsc.1050.0406","volume":"51","author":"Campbell","year":"2005","journal-title":"Manage. Sci."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1287\/mnsc.1050.0407","volume":"51","author":"Campbell","year":"2005","journal-title":"Manage. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2016.08.008","volume":"78","author":"Canca","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tre.2019.04.007","volume":"127","author":"Canca","year":"2019","journal-title":"Transp. Res. E Logist. Transp. Rev."},{"key":"R11","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":"R12","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1080\/13675567.2019.1708873","volume":"23","author":"Chen","year":"2020","journal-title":"Int. J. Logist. Res. Appl."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Contreras I. and O\u2019Kelly M., Hub location problems. In: Location Science, edited by Laporte G., Nickel S. and Saldanha da Gama F.. Springer International Publishing, Cham (2019) 327\u2013363.","DOI":"10.1007\/978-3-030-32177-2_12"},{"key":"R14","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2009.05.044","volume":"202","author":"Contreras","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R15","unstructured":"Contreras I., Tanash M. and Vidyarthi N., The cycle hub location problem. Montreal, Technical Report CIRRELT (2013)."},{"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. Logist."},{"key":"R17","unstructured":"De-Los-Santos A., Laporte G., Mesa J.A. and Perea F., Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints. In: 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Vol. 42. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2014) 107\u2013121."},{"key":"R18","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":"R19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1080\/18756891.2013.870753","volume":"7","author":"Escudero","year":"2014","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"R20","unstructured":"Garcia R., Garzon-Astolfi A., Marn A., Mesa J.A. and Ortega F.A., Analysis of the parameters of transfers in rapid transit network design. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS\u201905). Vol. 2. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2006)."},{"key":"R21","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. E Logist. Transp. Rev."},{"key":"R22","doi-asserted-by":"crossref","first-page":"3000","DOI":"10.1016\/j.cor.2013.06.013","volume":"40","author":"Guti\u00e9rrez-Jarpa","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cor.2016.08.009","volume":"78","author":"Guti\u00e9rrez-Jarpa","year":"2017","journal-title":"Comput. Oper. Res."},{"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.cie.2017.12.020","volume":"116","author":"Karimi","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"R26","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.tre.2017.10.004","volume":"108","author":"Kartal","year":"2017","journal-title":"Transp. Res. E Logist. Transp. Rev."},{"key":"R27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10479-019-03430-9","volume":"296","author":"Kaveh","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"R28","doi-asserted-by":"crossref","first-page":"S2831","DOI":"10.1051\/ro\/2020125","volume":"55","author":"Kemmar","year":"2021","journal-title":"RAIRO: Oper. Res."},{"key":"R29","doi-asserted-by":"crossref","first-page":"393","DOI":"10.5267\/j.uscm.2017.12.005","volume":"6","author":"Khosravi","year":"2018","journal-title":"Uncertain Supply Chain Manag."},{"key":"R30","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0966-8349(98)00042-4","volume":"6","author":"Klincewicz","year":"1998","journal-title":"Location Sci."},{"key":"R31","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.20193","volume":"51","author":"Labb\u00e9","year":"2008","journal-title":"Networks"},{"key":"R32","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10479-005-2038-0","volume":"136","author":"Laporte","year":"2005","journal-title":"Ann. Oper. Res."},{"key":"R33","doi-asserted-by":"crossref","unstructured":"Laporte G., Mar\u00edn \u00c1., Mesa J.A. and Ortega F.A., An integrated methodology for the rapid transit network design problem. In: Algorithmic Methods for Railway Optimization. Vol. 4359. Springer, Berlin (2007) 187\u2013199.","DOI":"10.1007\/978-3-540-74247-0_9"},{"key":"R34","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1002\/atr.132","volume":"45","author":"Laporte","year":"2011","journal-title":"J. Adv. Transp."},{"key":"R35","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.cor.2016.12.006","volume":"80","author":"L\u00f3pez-Ramos","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"R36","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/trsc.2017.0756","volume":"53","author":"Mah\u00e9o","year":"2019","journal-title":"Transp. Sci."},{"key":"R37","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1111\/gean.12075","volume":"47","author":"Mahmuto\u011fullar","year":"2015","journal-title":"Geog. Anal."},{"key":"R38","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s11750-007-0017-0","volume":"15","author":"Mar\u00edn","year":"2007","journal-title":"TOP"},{"key":"R39","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1016\/j.cor.2008.02.008","volume":"36","author":"Mar\u00edn","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"R40","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":"R41","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":"R42","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02564791","volume":"6","author":"Nagy","year":"1998","journal-title":"TOP"},{"key":"R43","doi-asserted-by":"crossref","unstructured":"Nickel S., Sch\u00f6bel A., Sonneborn T., Hub location problems in urban traffic networks. In: Mathematical Methods on Optimization in Transportation Systems, edited by Pursula M. and Niittym\u00e4ki J.. Springer, Boston (2001) 95\u2013107.","DOI":"10.1007\/978-1-4757-3357-0_6"},{"key":"R44","doi-asserted-by":"crossref","first-page":"105715","DOI":"10.1016\/j.cor.2022.105715","volume":"142","author":"Oliveira","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"R45","doi-asserted-by":"crossref","unstructured":"Pisinger D. and Ropke S., Large Neighborhood Search. In: Handbook of Metaheuristics, edited by Gendreau M. and Potvin J.-Y.. Springer International Publishing, Cham (2019) 99\u2013127.","DOI":"10.1007\/978-3-319-91086-4_4"},{"key":"R46","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/trsc.1120.0425","volume":"47","author":"Repolho","year":"2013","journal-title":"Transp. Sci."},{"key":"R47","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"Ropke","year":"2006","journal-title":"Transp. Sci."},{"key":"R48","doi-asserted-by":"crossref","unstructured":"Shushan C., Qinghuai L. and Zhong S., Design of urban rail transit network constrained by urban road network, trips and land-use characteristics. Sustainability 11 (2019).","DOI":"10.3390\/su11216128"},{"key":"R49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.omega.2018.05.016","volume":"86","author":"Taherkhani","year":"2019","journal-title":"Omega"},{"key":"R50","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1002\/net.20139","volume":"49","author":"Tan","year":"2007","journal-title":"Networks"},{"key":"R51","doi-asserted-by":"crossref","first-page":"119247","DOI":"10.1016\/j.jclepro.2019.119247","volume":"248","author":"Tavassoli","year":"2020","journal-title":"J. Cleaner Prod."},{"key":"R52","doi-asserted-by":"crossref","first-page":"2520","DOI":"10.1016\/j.cor.2005.09.018","volume":"34","author":"Thomadsen","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"R53","doi-asserted-by":"crossref","first-page":"3334","DOI":"10.1007\/s40314-017-0512-3","volume":"37","author":"Tikani","year":"2018","journal-title":"Comput. Appl. Math."},{"key":"R54","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.cstp.2016.12.003","volume":"5","author":"Verma","year":"2017","journal-title":"Case Stud. Transp. Policy"},{"key":"R55","doi-asserted-by":"crossref","first-page":"105903","DOI":"10.1016\/j.cor.2022.105903","volume":"146","author":"Windras Mara","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"R56","first-page":"709389","volume":"2015","author":"Wu","year":"2015","journal-title":"Math. Probl. Eng."},{"key":"R57","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. B: Methodol."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022170\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T09:13:05Z","timestamp":1667293985000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":57,"journal-issue":{"issue":"5"},"alternative-id":["ro220402"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022170","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}