IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-77903-2_20.html
   My bibliography  Save this book chapter

A Benders Decomposition for Hub Location Problems Arising in Public Transport

In: Operations Research Proceedings 2007

Author

Listed:
  • Shahin Gelareh

    (Fraunhofer Institut für Techno-und Wirtscaftsmathematik (ITWM))

  • Stefan Nickel

    (Universität des Saarlandes)

Abstract

In the last two decades, among the large amount of literature available on Hub Location Problems (HLP), applications in Public Transport (PT) have received less attentions compared to other fields, for example telecommunications. The first mathematical model for HLPs is proposed by O’Kelly [5] in 1987. In a HLP network, the flow originated from an origin i and destinated to node j is not shipped directly, rather, it is sent via some selected intermediate nodes (called hub nodes) and maybe intermediate edges (called hub edges) connecting these hubs. The sub-network composed of these hub facilities is known as hub-level network. The remaining nodes and edges are called spoke nodes or spoke edges of the spoke-level network. For applications in public transport planning, the hub level network consists of special types of transportation facilities which may be fast-lines, etc. Fig. 1 depicts a simple hub location model applied to public transport planning.

Suggested Citation

  • Shahin Gelareh & Stefan Nickel, 2008. "A Benders Decomposition for Hub Location Problems Arising in Public Transport," Operations Research Proceedings, in: Jörg Kalcsics & Stefan Nickel (ed.), Operations Research Proceedings 2007, pages 129-134, Springer.
  • Handle: RePEc:spr:oprchp:978-3-540-77903-2_20
    DOI: 10.1007/978-3-540-77903-2_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    2. Ghaffarinasab, Nader & Çavuş, Özlem & Kara, Bahar Y., 2023. "A mean-CVaR approach to the risk-averse single allocation hub location problem with flow-dependent economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 32-53.
    3. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.

    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:spr:oprchp:978-3-540-77903-2_20. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.