A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure

References

• Andersen, Martin W. 2010. Service Network Design and Management in Liner Container Shipping Applications. kongens lyngby: DTU Transport.
   Google Scholar
• Aykin, Turgut. 1995. “The Hub Location and Routing Problem.” European Journal of Operational Research 83 (1): 200–219. doi: 10.1016/0377-2217(93)E0173-U
   Web of Science ®Google Scholar
• Bellmore, Mandel, and George L. Nemhauser. 1968. “The Traveling Salesman Problem: A Survey.” Operations Research 16 (3): 538–558. doi: 10.1287/opre.16.3.538
   Web of Science ®Google Scholar
• Bostel, Nathalie, Pierre Dejax, and Mi Zhang. 2015. “A Model and A Metaheuristic Method for the Hub Location Routing Problem and Application to Postal Services.” In 2015 International Conference on Industrial Engineering and Systems Management (IESM), 1383–1389. IEEE.
   Google Scholar
• Bryan, Deborah L., and Morton E. O'Kelly. 1999. “Hub-and-spoke Networks in Air Transportation: An Analytical Review.” Journal of Regional Science 39 (2): 275–295. doi: 10.1111/1467-9787.00134
   Web of Science ®Google Scholar
• Campbell, James F. 1994. “Integer Programming Formulations of Discrete Hub Location Problems.” European Journal of Operational Research 72 (2): 387–405. doi: 10.1016/0377-2217(94)90318-2
   Web of Science ®Google Scholar
• Çetiner, Selim, Canan Sepil, and Haldun Süral. 2010. “Hubbing and Routing in Postal Delivery Systems.” Annals of Operations Research 181 (1): 109–124. doi: 10.1007/s10479-010-0705-2
   Web of Science ®Google Scholar
• Christiansen, Marielle, Kjetil Fagerholt, Bjørn Nygreen, and David Ronen. 2013. “Ship Routing and Scheduling in the New Millennium.” European Journal of Operational Research 228 (3): 467–483. doi: 10.1016/j.ejor.2012.12.002
   Web of Science ®Google Scholar
• Contreras, Ivan, Moayad Tanash, and Navneet Vidyarthi. 2016. “Exact and Heuristic Approaches for the Cycle Hub Location Problem.” Annals of Operations Research 258 (2): 1–23.
   Web of Science ®Google Scholar
• Crainic, Teodor Gabriel, and Kap Hwan Kim. 2007. “‘Intermodal Transportation’.” Handbooks in Operations Research and Management Science 14: 467–537. doi: 10.1016/S0927-0507(06)14008-6
   Google Scholar
• Cunha, Claudio B., and Marcos Roberto Silva. 2007. “A Genetic Algorithm for the Problem of Configuring a Hub-and-spoke Network for a LTL Trucking Company in Brazil.” European Journal of Operational Research 179 (3): 747–758. doi: 10.1016/j.ejor.2005.03.057
   Web of Science ®Google Scholar
• da Costa Fontes, Fábio Francisco, and Gilles Goncalves. 2017. “A New Hub Network Design Integrating Deep Sea and Short Sea Services At Liner Shipping Operations.” Int. J. Shipping and Transport Logistics 9 (5): 580–600. doi: 10.1504/IJSTL.2017.10005727
   Web of Science ®Google Scholar
• da Costa Fontes, Fábio Francisco, and Gilles Goncalves. 2018. “A VNDS Approach for the Liner Shipping Transport in a Structure of Hub-and-Spoke with Sub-Hub.” IFAC-PapersOnLine 51 (11): 247–252. doi: 10.1016/j.ifacol.2018.08.281
   Google Scholar
• de Camargo, Ricardo Saraiva, Gilberto de Miranda, and Arne Løkketangen. 2013. “A New Formulation and An Exact Approach for the Many-to-many Hub Location-routing Problem.” Applied Mathematical Modelling 37 (12): 7465–7480. doi: 10.1016/j.apm.2013.02.035
   Web of Science ®Google Scholar
• Dijkstra, Edsger W. 1959. “A Note on Two Problems in Connexion with Graphs.” Numerische mathematik 1 (1): 269–271. doi: 10.1007/BF01386390
   Google Scholar
• Drexl, Michael, and Michael Schneider. 2015. “A Survey of Variants and Extensions of the Location-routing Problem.” European Journal of Operational Research 241 (2): 283–308. doi: 10.1016/j.ejor.2014.08.030
   Web of Science ®Google Scholar
• Ghaffarinasab, Nader, Tom Van Woensel, and Stefan Minner. 2018. “A Continuous Approximation Approach to the Planar Hub Location-routing Problem: Modeling and Solution Algorithms.” Computers & Operations Research 100: 140–154. doi: 10.1016/j.cor.2018.07.022
   Web of Science ®Google Scholar
• Hansen, Pierre, Nenad Mladenović, Raca Todosijević, and Saïd Hanafi. 2016. “Variable Neighborhood Search: Basics and Variants.” EURO Journal on Computational Optimization 5 (3): 1–32.
   Web of Science ®Google Scholar
• Hoffmann, Jan, Regina Asariotis, Mark Assaf, Hassiba Benamara, Wendy Juan, Anila Premti, Luisa Rodríguez, Shamika N. Sirimanne, Mathis Weller, and Frida Youssef. 2018. Review of Maritime Transport, 2018. Technical Report. United Nations Conference on Trade And Development UNCTAD.
   Google Scholar
• Jeong, Seung-Ju, Chi-Guhn Lee, and James H. Bookbinder. 2007. “The European Freight Railway System As a Hub-and-spoke Network.” Transportation Research Part A: Policy and Practice 41 (6): 523–536.
   Web of Science ®Google Scholar
• Kartal, Zuhal, Servet Hasgul, and Andreas T. Ernst. 2017. “Single Allocation P-hub Median Location and Routing Problem with Simultaneous Pick-up and Delivery.” Transportation Research Part E: Logistics and Transportation Review 108: 141–159. doi: 10.1016/j.tre.2017.10.004
   Web of Science ®Google Scholar
• Labbé, Martine, Gilbert Laporte, Inmaculada Rodríguez Martín, and Juan José Salazar González. 2004. “The Ring Star Problem: Polyhedral Analysis and Exact Algorithm.” Networks: An International Journal 43 (3): 177–189. doi: 10.1002/net.10114
   Web of Science ®Google Scholar
• Lopes, Mauro Cardoso, Carlos Eduardo de Andrade, Thiago Alves de Queiroz, Mauricio G. C. Resende, and Flávio Keidi Miyazawa. 2016. “Heuristics for a Hub Location-routing Problem.” Networks 68 (1): 54–90. doi: 10.1002/net.21685
   Web of Science ®Google Scholar
• Mahmutoğulları, Ali İrfan, and Bahar Yetis Kara. 2015. “Hub Location Problem with Allowed Routing Between Nonhub Nodes.” Geographical Analysis 47 (4): 410–430. doi: 10.1111/gean.12075
   Web of Science ®Google Scholar
• Mladenović, Nenad, Jack Brimberg, Pierre Hansen, and José A Moreno-Pérez. 2007. “The P-median Problem: A Survey of Metaheuristic Approaches.” European Journal of Operational Research179 (3): 927–939. doi: 10.1016/j.ejor.2005.05.034
   Web of Science ®Google Scholar
• Nagy, Gábor, and Said Salhi. 1998. “The Many-to-many Location-routing Problem.” Top 6 (2): 261–275. doi: 10.1007/BF02564791
   Google Scholar
• Nagy, Gábor, and Saïd Salhi. 2007. “Location-routing: Issues, Models and Methods.” European Journal of Operational Research 177 (2): 649–672. doi: 10.1016/j.ejor.2006.04.004
   Web of Science ®Google Scholar
• O'Kelly, Morton E. 1986. “The Location of Interacting Hub Facilities.” Transportation Science 20 (2): 92–106. doi: 10.1287/trsc.20.2.92
   Web of Science ®Google Scholar
• Plum, Christian E. M., David Pisinger, and Mikkel M. Sigurd. 2014. “A Service Flow Model for the Liner Shipping Network Design Problem.” European Journal of Operational Research 235 (2): 378–386. doi: 10.1016/j.ejor.2013.10.057
   Web of Science ®Google Scholar
• Reese, J. 2005. “Methods for Solving the p-Median Problem: An Annotated Bibliography, Trinity University, Mathematics Faculty Research, Paper 28.” Available in http://digitalcommons.trinity.edu/mathfaculty/28.
   Google Scholar
• Rieck, Julia, Carsten Ehrenberg, and Jürgen Zimmermann. 2014. “Many-to-many Location-routing with Inter-hub Transport and Multi-commodity Pickup-and-delivery.” European Journal of Operational Research 236 (3): 863–878. doi: 10.1016/j.ejor.2013.12.021
   Web of Science ®Google Scholar
• Rodríguez-Martín, Inmaculada, Juan-José Salazar-González, and Hande Yaman. 2014. “A Branch-and-cut Algorithm for the Hub Location and Routing Problem.” Computers & Operations Research 50: 161–174. doi: 10.1016/j.cor.2014.04.014
   Web of Science ®Google Scholar
• Rodríguez-Martín, Inmaculada, Juan-José Salazar-González, and Hande Yaman. 2016a. “Hierarchical Survivable Network Design Problems.” Electronic Notes in Discrete Mathematics 52: 229–236. doi: 10.1016/j.endm.2016.03.030
   Google Scholar
• Rodríguez-Martín, Inmaculada, Juan-José Salazar-González, and Hande Yaman. 2016b. “The Ring/κ-rings Network Design Problem: Model and Branch-and-cut Algorithm.” Networks 68 (2): 130–140. doi: 10.1002/net.21687
   Web of Science ®Google Scholar
• Saboury, Ali, Nader Ghaffari-Nasab, Farnaz Barzinpour, and Mohamad Saeed Jabalameli. 2013. “Applying Two Efficient Hybrid Heuristics for Hub Location Problem with Fully Interconnected Backbone and Access Networks.” Computers & Operations Research 40 (10): 2493–2507. doi: 10.1016/j.cor.2013.01.008
   Web of Science ®Google Scholar
• Sun, Ji Ung. 2016. “A Hierarchical Bio-inspired Computing for the Hub Location-Routing Problem in Parcel Service.” International Journal of Applied Engineering Research 11 (8): 5357–5362.
   Google Scholar
• Sung, C. S., and H. W. Jin. 2001. “Dual-based Approach for a Hub Network Design Problem Under Non-restrictive Policy.” European Journal of Operational Research 132 (1): 88–105. doi: 10.1016/S0377-2217(00)00114-4
   Web of Science ®Google Scholar
• Thomadsen, Tommy. 2005. “Hierarchical Network Design.” PhD thesis in Informatics and Mathematical Modelling, Technical University of Denmark.
   Google Scholar
• Thomadsen, Tommy, and Jesper Larsen. 2007. “A Hub Location Problem with Fully Interconnected Backbone and Access Networks.” Computers & Operations Research 34 (8): 2520–2531. doi: 10.1016/j.cor.2005.09.018
   Web of Science ®Google Scholar
• Thomadsen, Tommy, and Thomas Stidsen. 2005. “Hierarchical Ring Network Design Using Branch-and-price.” Telecommunication Systems 29 (1): 61–76. doi: 10.1007/s11235-005-6631-y
   Web of Science ®Google Scholar
• Wagner, Bernd. 2007. “An Exact Solution Procedure for a Cluster Hub Location Problem.” European Journal of Operational Research 178 (2): 391–401. doi: 10.1016/j.ejor.2006.02.011
   Web of Science ®Google Scholar