IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v26y2009i01ns0217595909002080.html
   My bibliography  Save this article

The Continuous Stop Location Problem In Public Transportation Networks

Author

Listed:
  • ANITA SCHöBEL

    (Institut für Numerische und Angewandte Mathematik, Lotzestrasse 16–18, D 37083 Göttingen, Germany)

  • HORST W. HAMACHER

    (Technische Universität Kaiserslautern, Postfach 3049, D 67653 Kaiserslautern, Germany)

  • ANNEGRET LIEBERS

    (Siemens AG, Mobility Division, Infrastructure Logistics, Bücklestr. t5, D 78467 Konstanz, Germany)

  • DOROTHEA WAGNER

    (Institut für Theoretische Informatik, Postfach 6980, D 76128 Karlsruhe, Germany)

Abstract

In this paper we consider the location of stops along the edges of an already existing public transportation network. This can be the introduction of bus stops along some given bus routes, or of railway stations along the tracks in a railway network.The positive effect of new stops is given by the better access of the potential customers to public transportation, while the travel time increases due to the additional stopping activities of the trains. The latter leads to a negative effect for the customers. The goal is tocoverall given demand points with a minimal amount of additional traveling time, where covering may be defined with respect to an arbitrary norm or gauge. This problem is NP-hard, even in the special case of Euclidean distances. In this paper, we derive a finite candidate set leading to a discrete set covering problem. Moreover, we identify network structures in which the coefficient matrix of the resulting set covering problem is totally unimodular, such that the problem can be solved efficiently in this case. Extensions of the problem are also discussed.

Suggested Citation

  • Anita Schöbel & Horst W. Hamacher & Annegret Liebers & Dorothea Wagner, 2009. "The Continuous Stop Location Problem In Public Transportation Networks," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(01), pages 13-30.
    • Handle: RePEc:wsi:apjorx:v:26:y:2009:i:01:n:s0217595909002080
    DOI: 10.1142/S0217595909002080
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595909002080
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595909002080?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. Konrad Steiner & Stefan Irnich, 2018. "Schedule-Based Integrated Intercity Bus Line Planning via Branch-and-Cut," Transportation Science, INFORMS, vol. 52(4), pages 882-897, August.
    2. Manout, Ouassim & Bonnel, Patrick & Bouzouina, Louafi, 2018. "Transit accessibility: A new definition of transit connectors," Transportation Research Part A: Policy and Practice, Elsevier, vol. 113(C), pages 88-100.
    3. Hugo M. Repolho & António P. Antunes & Richard L. Church, 2013. "Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line," Transportation Science, INFORMS, vol. 47(3), pages 330-343, August.
    4. Batta, Rajan & Lejeune, Miguel & Prasad, Srinivas, 2014. "Public facility location using dispersion, population, and equity criteria," European Journal of Operational Research, Elsevier, vol. 234(3), pages 819-829.
    5. Nazanin Abbasnezhad & Javad Mehri-Takmeh & Javad Vakili, 2020. "The domination over time and its discretisation," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 30(1), pages 5-24.
    6. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    7. S. Haddadi, 2017. "Benders decomposition for set covering problems," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 60-80, January.
    8. M. C. López-de-los-Mozos & Juan A. Mesa, 2022. "To stop or not to stop: a time-constrained trip covering location problem on a tree network," Annals of Operations Research, Springer, vol. 316(2), pages 1039-1061, September.

    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:wsi:apjorx:v:26:y:2009:i:01:n:s0217595909002080. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.