IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i2p410-422.html
   My bibliography  Save this article

Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem

Author

Listed:
  • Yuehui Wu
  • Ali Gul Qureshi
  • Tadashi Yamada
  • Shanchuan Yu

Abstract

The paper focuses on a variant of hub location routeing problem arising in the design of intra-city express service networks, named as capacitated single allocation hub location routeing problem, in which each non-hub node should be served by exactly one hub, and both hub capacity and vehicle capacity are considered. A new mixed-integer programming formulation for the problem is provided, and a solution algorithm is developed on the basis of the column generation scheme to exactly solve the problem for the first time. The pricing subproblem is solved by a bidirectional labelling algorithm, and the master problem is strengthened by valid inequalities. Numerical experiments are conducted on the instances generated from the Australian Post dataset to test the performance of the model and the developed algorithm. Computational results prove that the algorithm outperforms the CPLEX and is able to provide optimal solutions for instances with up to 35 non-hub nodes and high-quality solutions for instances with 40 non-hub nodes within reasonable computational time, which indicates the feasibility and efficiency of the model and algorithm proposed.

Suggested Citation

  • Yuehui Wu & Ali Gul Qureshi & Tadashi Yamada & Shanchuan Yu, 2024. "Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(2), pages 410-422, February.
    • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:2:p:410-422
    DOI: 10.1080/01605682.2023.2197933
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2197933
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2023.2197933?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.

    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:tjorxx:v:75:y:2024:i:2:p:410-422. 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/tjor .

    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.