Open Access
RAIRO-Oper. Res.
Volume 56, Number 5, September-October 2022
Page(s) 3733 - 3763
Published online 01 November 2022
  • R.K. Ahuja, Ö. Ergun, J.B. Orlin and A.P. Punnen, A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123 (2002) 75–102. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Alibeyg, I. Contreras and E. Fernández, Hub network design problems with profits. Transp. Res. E Logist. Transp. Rev. 96 (2016) 40–59. [CrossRef] [Google Scholar]
  • T. Aykin, Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Oper. Res. 79 (1994) 501–523. [CrossRef] [Google Scholar]
  • M. Basirati, M.R. Akbari Jokar and E. Hassannayebi, Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window. Neural. Comput. Appl. 32 (2020) 13267–13288. [CrossRef] [Google Scholar]
  • G. Bruno, G. Ghiani and G. Improta, A multi-modal approach to the location of a rapid transit line. Eur. J. Oper. Res. 104 (1998) 321–332. [CrossRef] [Google Scholar]
  • L. Cadarso and Á. Marín, Improved rapid transit network design model: considering transfer effects. Ann. Oper. Res. 258 (2017) 547–567. [CrossRef] [MathSciNet] [Google Scholar]
  • J.F. Campbell, A.T. Ernst and M. Krishnamoorthy, Hub arc location problems: Part I - Introduction and results. Manage. Sci. 51 (2005) 1540–1555. [CrossRef] [Google Scholar]
  • J.F. Campbell, A.T. Ernst and M. Krishnamoorthy, Hub arc location problems: Part II – Formulations and optimal algorithms. Manage. Sci. 51 (2005) 1556–1571. [CrossRef] [Google Scholar]
  • D. Canca, A. De-Los-Santos, G. Laporte and J.A. Mesa, An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. Comput. Oper. Res. 78 (2017) 1–14. [CrossRef] [MathSciNet] [Google Scholar]
  • D. Canca, A. De-Los-Santos, G. Laporte and J.A. Mesa, Integrated railway rapid transit network design and line planning problem with maximum profit. Transp. Res. E Logist. Transp. Rev. 127 (2019) 1–30. [CrossRef] [Google Scholar]
  • S. Çetiner, C. Sepil and H. Süral, Hubbing and routing in postal delivery systems. Ann. Oper. Res. 181 (2010) 109–124. [CrossRef] [MathSciNet] [Google Scholar]
  • K. Chen, X. Xin, T. Zhang and Z. Yang, Multiport cooperative location model with a safe-corridors setting in West Africa. Int. J. Logist. Res. Appl. 23 (2020) 580–601. [CrossRef] [Google Scholar]
  • I. Contreras and M. O’Kelly, Hub location problems. In: Location Science, edited by G. Laporte, S. Nickel and F. Saldanha da Gama. Springer International Publishing, Cham (2019) 327–363. [CrossRef] [Google Scholar]
  • I. Contreras, E. Fernández and A. Marín, The tree of hubs location problem. Eur. J. Oper. Res. 202 (2010) 390–400. [CrossRef] [Google Scholar]
  • I. Contreras, M. Tanash and N. Vidyarthi, The cycle hub location problem. Montreal, Technical Report CIRRELT (2013). [Google Scholar]
  • K. Danach, S. Gelareh and R. Neamatian Monemi, The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach. EURO J Transp. Logist. 8 (2019) 597–631. [CrossRef] [Google Scholar]
  • A. De-Los-Santos, G. Laporte, J.A. Mesa and F. Perea, 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–121. [Google Scholar]
  • A.T. Ernst and M. Krishnamoorthy, Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4 (1996) 139–154. [CrossRef] [Google Scholar]
  • L.F. Escudero and S. Muñoz, A survey-based approach for selecting the stations and links for a rapid transit network. Int. J. Comput. Intell. Syst. 7 (2014) 565–581. [CrossRef] [Google Scholar]
  • R. Garcia, A. Garzon-Astolfi, A. Marn, J.A. Mesa and F.A. Ortega, Analysis of the parameters of transfers in rapid transit network design. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS’05). Vol. 2. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2006). [Google Scholar]
  • S. Gelareh and S. Nickel, Hub location problems in transportation networks. Transp. Res. E Logist. Transp. Rev. 47 (2011) 1092–1111. [CrossRef] [Google Scholar]
  • G. Gutiérrez-Jarpa, C. Obreque, G. Laporte and V. Marianov, Rapid transit network design for optimal cost and origin-destination demand capture. Comput. Oper. Res. 40 (2013) 3000–3009. [CrossRef] [Google Scholar]
  • G. Gutiérrez-Jarpa, G. Laporte, V. Marianov and L. Moccia, Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile. Comput. Oper. Res. 78 (2017) 27–43. [CrossRef] [MathSciNet] [Google Scholar]
  • D. Huang, Z. Liu, X. Fu and P.T. Blythe, Multimodal transit network design in a hub-and-spoke network framework. Transp. A: Transp. Sci. 14 (2018) 706–735. [Google Scholar]
  • H. Karimi, The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems. Comput. Ind. Eng. 116 (2018) 47–58. [CrossRef] [Google Scholar]
  • Z. Kartal, S. Hasgul and A.T. Ernst, Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery. Transp. Res. E Logist. Transp. Rev. 108 (2017) 141–159. [CrossRef] [Google Scholar]
  • F. Kaveh, R. Tavakkoli-Moghaddam, C. Triki, Y. Rahimi and A. Jamili, A new bi-objective model of the urban public transportation hub network design under uncertainty. Ann. Oper. Res. 296 (2019) 131–162. [Google Scholar]
  • O. Kemmar, K. Bouamrane and S. Gelareh, Hub location problem in round-trip service applications. RAIRO: Oper. Res. 55 (2021) S2831–S2858. [CrossRef] [EDP Sciences] [Google Scholar]
  • S. Khosravi and M. Jokar, Many to many hub and spoke location routing problem based on the gravity rule. Uncertain Supply Chain Manag. 6 (2018) 393–406. [CrossRef] [Google Scholar]
  • J.G. Klincewicz, Hub location in backbone/tributary network design: a review. Location Sci. 6 (1998) 307–335. [CrossRef] [Google Scholar]
  • M. Labbé and H. Yaman, Solving the hub location problem in a star–star network. Networks 51 (2008) 19–33. [CrossRef] [MathSciNet] [Google Scholar]
  • G. Laporte, J.A. Mesa, F.A. Ortega and I. Sevillano, Maximizing trip coverage in the location of a single rapid transit alignment. Ann. Oper. Res. 136 (2005) 49–63. [CrossRef] [MathSciNet] [Google Scholar]
  • G. Laporte, Á. Marín, J.A. Mesa and F.A. Ortega, An integrated methodology for the rapid transit network design problem. In: Algorithmic Methods for Railway Optimization. Vol. 4359. Springer, Berlin (2007) 187–199. [CrossRef] [Google Scholar]
  • G. Laporte, A. Marín, J.A. Mesa and F. Perea, Designing robust rapid transit networks with alternative routes. J. Adv. Transp. 45 (2011) 54–65. [CrossRef] [Google Scholar]
  • F. López-Ramos, E. Codina, Á. Marín and A. Guarnaschelli, Integrated approach to network design and frequency setting problem in railway rapid transit systems. Comput. Oper. Res. 80 (2017) 128–146. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Mahéo, P. Kilby and P.V. Hentenryck, Benders decomposition for the design of a hub and shuttle public transit system. Transp. Sci. 53 (2019) 77–88. [CrossRef] [Google Scholar]
  • Aİ. Mahmutoğullar and B.Y. Kara, Hub location problem with allowed routing between nonhub nodes. Geog. Anal. 47 (2015) 410–430. [CrossRef] [Google Scholar]
  • Á. Marín, An extension to rapid transit network design problem. TOP 15 (2007) 231–241. [CrossRef] [MathSciNet] [Google Scholar]
  • Á. Marín and R. García-Ródenas, Location of infrastructure in urban railway networks. Comput. Oper. Res. 36 (2009) 1461–1477. [CrossRef] [Google Scholar]
  • E. Martins de Sá, I. Contreras and J.-F. Cordeau, Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. 246 (2015) 186–198. [CrossRef] [Google Scholar]
  • E. Martins de Sá, I. Contreras, J.-F. Cordeau, R.S. de Camargo and G. de Miranda, The hub line location problem. Transp. Sci. 49 (2015) 500–518. [CrossRef] [Google Scholar]
  • G. Nagy and S. Salhi, The many-to-many location-routing problem. TOP 6 (1998) 261–275. [CrossRef] [MathSciNet] [Google Scholar]
  • S. Nickel, A. Schöbel, T. Sonneborn, Hub location problems in urban traffic networks. In: Mathematical Methods on Optimization in Transportation Systems, edited by M. Pursula and J. Niittymäki. Springer, Boston (2001) 95–107. [CrossRef] [Google Scholar]
  • F.A. Oliveira, E.M. de Sá and S.R. de Souza, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network. Comput. Oper. Res. 142 (2022) 105715. [CrossRef] [Google Scholar]
  • D. Pisinger and S. Ropke, Large Neighborhood Search. In: Handbook of Metaheuristics, edited by M. Gendreau and J.-Y. Potvin. Springer International Publishing, Cham (2019) 99–127. [CrossRef] [Google Scholar]
  • H.M. Repolho, A.P. Antunes and R.L. Church, Optimal location of railway stations: the Lisbon-Porto high-speed rail line. Transp. Sci. 47 (2013) 330–343. [CrossRef] [Google Scholar]
  • S. Ropke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40 (2006) 455–472. [CrossRef] [Google Scholar]
  • C. Shushan, L. Qinghuai and S. Zhong, Design of urban rail transit network constrained by urban road network, trips and land-use characteristics. Sustainability 11 (2019). [Google Scholar]
  • G. Taherkhani and S.A. Alumur, Profit maximizing hub location problems. Omega 86 (2019) 1–15. [CrossRef] [Google Scholar]
  • P.Z. Tan and B.Y. Kara, A hub covering model for cargo delivery systems. Networks 49 (2007) 28–39. [CrossRef] [MathSciNet] [Google Scholar]
  • K. Tavassoli and M. Tamannaei, Hub network design for integrated Bike-and-Ride services: a competitive approach to reducing automobile dependence. J. Cleaner Prod. 248 (2020) 119247. [CrossRef] [Google Scholar]
  • T. Thomadsen and J. Larsen, A hub location problem with fully interconnected backbone and access networks. Comput. Oper. Res. 34 (2007) 2520–2531. [CrossRef] [Google Scholar]
  • H. Tikani, M. Honarvar and Y.Z. Mehrjerdi, Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry. Comput. Appl. Math. 37 (2018) 3334–3364. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Verma, A. Kumari, D. Tahlyan and A.B. Hosapujari, Development of hub and spoke model for improving operational efficiency of bus transit network of Bangalore city. Case Stud. Transp. Policy 5 (2017) 71–79. [CrossRef] [Google Scholar]
  • S.T. Windras Mara, R. Norcahyo, P. Jodiawan, L. Lusiantoro and A.P. Rifai, A survey of adaptive large neighborhood search algorithms and applications, Comput. Oper. Res. 146 (2022) 105903. [CrossRef] [Google Scholar]
  • J. Wu, R. Song, Y. Wang, F. Chen and S. Li, Modeling the Coordinated operation between bus rapid transit and bus. Math. Probl. Eng. 2015 (2015) 709389. [Google Scholar]
  • H. Yaman, B.Y. Kara and B.Ç. Tansel, The latest arrival hub location problem for cargo delivery systems with stopovers. Transp. Res. B: Methodol. 41 (2007) 906–919. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.