IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v194y2025ics1366554524004939.html
   My bibliography  Save this article

The hub location problem with comparisons of compact formulations: A note

Author

Listed:
  • Setiawan, Fran
  • Bektaş, Tolga
  • Iris, Çağatay

Abstract

Hub location is a planning problem that involves choosing, from a set of nodes, a subset to designate as hub facilities, linking the hubs to the remaining nodes using a hub-and-spoke structure, and routing of flows on the resulting network. This paper presents theoretical and computational comparisons of the fundamental compact formulations of the p-hub location problem (p-HLP) for three allocation strategies, namely single, multiple and r-allocation. Our theoretical results show that path-based formulations offer the strongest linear programming relaxation. The computational experiments, run on three prominent datasets using a state-of-the-art commercial solver indicate that, flow-based formulations generally solve the largest number of instances to optimality and require the shortest solution time, especially for large-scale instances.

Suggested Citation

  • Setiawan, Fran & Bektaş, Tolga & Iris, Çağatay, 2025. "The hub location problem with comparisons of compact formulations: A note," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    • Handle: RePEc:eee:transe:v:194:y:2025:i:c:s1366554524004939
    DOI: 10.1016/j.tre.2024.103902
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524004939
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103902?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.

    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:eee:transe:v:194:y:2025:i:c:s1366554524004939. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.