Abstract
In this paper we consider the location of stops along the edges of an already existing public transportation network. The positive effect of new stops is given by the better access of the passengers to the public transport network, while the passengers’ traveling time increases due to the additional stopping activities of the trains, which is a negative effect for the passengers. The problem has been treated in the literature where the most common model is to cover all demand points with a minimal number of new stops. In this paper, we follow this line and seek for a set of new stops covering all demand points but instead of minimizing the number of new stops we minimize the additional passengers’ traveling time due to the new stops. For computing this additional traveling time we do not only take the stopping times of the vehicles but also acceleration and deceleration of the vehicles into account. We show that the problem is NP-hard, but we are able to derive a finite candidate set and two tractable IP formulations. For linear networks we show that the problem is polynomially solvable. We also discuss the differences to the common models from literature showing that minimizing the number of new stops does not necessarily lead to a solution with minimal additional traveling times for the passengers. We finally provide a case study showing that our new model decreases the traveling times for the passengers while still achieving the minimal number of new stops.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Borndörfer R, Hoppmann H and Karbstein M (2015). Timetabling and passenger routing in public transport. Technical Report 15–31, ZIB Report, 2015. To appear in Proceedings of CASPT 2015.
Current J, Pirkul H and Rolland E (1994). Efficient algorithms for solving the shortest covering path problem. Transportation Science 28(4): 317–327.
Dollevoet T, Huisman D, Schmidt M and Schöbel A (2012). Delay management with rerouting of passengers. Transportation Science 46(1): 74–89.
Drezner Z, Drezner T and Wesolowsky GO (2009). Location with acceleration—Deceleration distance. European Journal of Operational Research 198(1): 157–164.
Gleason J (1975). A set covering approach to bus stop allocation. Omega 3(5): 605–608.
Hamacher HW, Liebers A, Schöbel A, Wagner D and Wagner F (2001). Locating new stops in a railway network. Electronic Notes in Theoretical Computer Science 50(1): 13–23.
Kolesar P, Walker W and Hausner J (1975). Determining the relation between fire engine travel times and travel distances in New York city. Operations Research 23(4): 614–627.
Körner M-C, Mesa JA, Perea F, Schöbel A and Scholz D (2014). A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments. TOP 22(1): 227–253.
Kranakis E, Penna P, Schlude K, Taylor DS and Widmayer P (2003). Improving customer proximity to railway stations. In: Petreschi R, Persiano G and Silvestri R (eds). CIAC. LNCS 2653, Springer: Berlin Heidelberg, pp 264–276.
Laporte G, Mesa JA and Ortega FA (2002). Locating stations on rapid transit lines. Computers and Operations Research 29(6): 741–759.
Mammana MF, Mecke S and Wagner D (2004). The station location problem on two intersecting lines. Electronic Notes in Theoretical Computer Science 92: 52–64.
Mecke S, Schöbel A and Wagner D (2006). Stop location—Complexity and approximation. In: OASIcs-OpenAccess Series in Informatics, volume 2 of Dagstuhl Seminar proceedings. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
Mecke S and Wagner D (2004). Solving geometric covering problems by data reduction. In: Albers S and Radzik T (eds) Proceedings of European Symposium on Algorithms (ESA), LNCS 3221, Springer: Berlin Heidelberg, pp 760–771.
Murray A (2001). Strategic analysis of public transport coverage. Socio-economic Planning Sciences 35(3): 175–188.
Murray A (2003). A coverage models for improving public transit system accessibility and expanding access. Annals of Operations Research 123(1): 143–156.
Murray A, Davis R, Stimson RJ and Ferreira L (1998). Public transportation access. Transportation Research D 3(5): 319–328.
Murray A and Wu X (2003). Accessibility tradeoffs in public transit planning. J. Geographical Syst. 5(1): 93–107.
Perea F, Mesa JA and Laporte G (2014). Adding a new station and a road link to a road—Rail network in the presence of modal competition. Transportation Research Part B: Methodological 68: 1–16.
Poetranto D, Hamacher HW, Horn S and Schöbel A (2009). Stop location design in public transportation networks: Covering and accessibility objectives. TOP 17(2): 335–346.
Ruf N and Schöbel A (2004). Set covering problems with almost consecutive ones property. Discrete Optimization 1(2): 215–228.
Schmidt M (2013). Simultaneous optimization of delay management decisions and passenger routes. Public Transport 5(1): 125–147.
Schmidt M (2014). Integrating Routing Decisions in Public Transportation Problems, Volume 89 of Optimization and Its Applications. Springer: New York.
Schmidt M and Schöbel A (2015a). The complexity of integrating routing decisions in public transportation models. Networks 65(3): 228–243.
Schmidt M and Schöbel A (2015b). Timetabling with passenger routing. OR Spectrum 37(1): 75–97.
Schöbel A (2005). Locating stops along bus or railway lines—A bicriteria problem. Annals of Operations Research 136(1): 211–227.
Schöbel A (2006). Optimization in Public Transportation. Stop Location, Delay Management and Tariff Planning from a Customer-oriented Point of View. Optimization and Its Applications. Springer: New York.
Schöbel A, Hamacher HW, Liebers A and Wagner D (2009). The continuous stop location problem in public transportation. Asia-Pacific Journal of Operational Research 26(1): 13–30.
Vuchic V (1981). Urban Public Transportation: Systems and Technology. Prentice-Hall: Englewood Cliffs, NJ, EU.
Wu C and Murray A (2005). Optimizing public transit quality and system access: The multiple-route, maximal covering/shortest path problem. Environment and Planning B: Planning and Design 32(2): 163–178.
Acknowledgements
The first author is partially supported by MTM2012-36163-C06-03 and P11-FQM-7603. The other authors are partially supported by the European Union Seventh Framework Programme (FP7-PEOPLE-2009-IRSES) under grant number 246647 with the New Zealand Government (project OptALI). Also, we thank the Simulationswissenschaftliches Zentrum Clausthal-Göttingen (SWZ) for financial support.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Carrizosa, E., Harbering, J. & Schöbel, A. Minimizing the passengers’ traveling time in the stop location problem. J Oper Res Soc 67, 1325–1337 (2016). https://doi.org/10.1057/jors.2016.3
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2016.3