IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i1p30-46.html
   My bibliography  Save this article

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

Author

Listed:
  • Fábio Francisco da Costa Fontes
  • Gilles Goncalves

Abstract

This paper presents a new concept for a hub-and-spoke network structure, called “sub-hub”, applied to global operations of liner shipping. Hub-and-spoke networks are widely used in transportation due to the economy of scale offered to the demands between hubs. However, efficient network structures require more than an economy of scale with regard to transport costs. This study therefore, aims to demonstrate that lower transport costs are achievable by a hub-and-spoke with sub-hub structure because the economy of scale this model provides is combined with shorter alternative paths. A short sea operation in liner shipping is a circular route at cluster level (the hub and its allocated spokes). A deep sea operation functions as a direct connection between hubs. A sub-hub is an intersection point between two regional (cluster) routes, thereby allowing the transshipment of goods, for certain demands, without using hub nodes. Hubs and sub-hubs are selected between the existing ports (nodes), and installation costs are not included for these models. A cutting plane approach was implemented. Although the computation results of the models, which are classified as hub location-routing problems, were compared on small instances, a Variable Neighbourhood Decomposition Search (VNDS) was implemented to test large instances.

Suggested Citation

  • Fábio Francisco da Costa Fontes & Gilles Goncalves, 2021. "A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure," International Journal of Production Research, Taylor & Francis Journals, vol. 59(1), pages 30-46, January.
  • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:1:p:30-46
    DOI: 10.1080/00207543.2019.1693652
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1693652
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1693652?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wu, Yuehui & Qureshi, Ali Gul & Yamada, Tadashi, 2022. "Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1113-1127.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:59:y:2021:i:1:p:30-46. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.