IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v56y2022i6p1432-1451.html

The Cheapest Ticket Problem in Public Transport

Author

Listed:
  • Anita Schöbel

    (Department of Mathematics, Technische Universität Kaiserslautern, 67663 Kaiserslautern, Germany; Fraunhofer Institute for Industrial Mathematics, 67663 Kaiserslautern, Germany)

  • Reena Urban

    (Department of Mathematics, Technische Universität Kaiserslautern, 67663 Kaiserslautern, Germany)

Abstract

Route choice models in public transport have been discussed for a long time. The main reason why a passenger chooses a specific path is usually based on its length or travel time. However, also the ticket price that passengers have to pay may influence their decision because passengers prefer cheaper paths over more expensive ones. In this paper, we deal with the cheapest ticket problem , which asks for a cheapest ticket to travel between a pair of stations. The complexity and the algorithmic approach to solve this problem depend crucially on the underlying fare structure ; for example, it is easy if the ticket price is proportional to the distance traveled (as in distance tariff fare structures), but may become NP-complete in zone tariff fare structures. We hence discuss the cheapest ticket problem for different variations of distance- and zone-based fare structures. We start by modeling the respective fare structure mathematically, then identify its main properties, and finally provide a polynomial algorithm, or prove NP-completeness of the cheapest ticket problem. We also provide general results on the combination of two fare structures, which is often observed in practice.

Suggested Citation

  • Anita Schöbel & Reena Urban, 2022. "The Cheapest Ticket Problem in Public Transport," Transportation Science, INFORMS, vol. 56(6), pages 1432-1451, November.
    • Handle: RePEc:inm:ortrsc:v:56:y:2022:i:6:p:1432-1451
    DOI: 10.1287/trsc.2022.1138
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2022.1138
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2022.1138?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
    ---><---

    References listed on IDEAS

    as
    1. Ralf Borndörfer & Heide Hoppmann & Marika Karbstein, 2017. "Passenger routing for periodic timetable optimization," Public Transport, Springer, vol. 9(1), pages 115-135, July.
    2. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bowen Cui & Jianwei Zhang, 2025. "Exact and Approximation Algorithms for Task Offloading with Service Caching and Dependency in Mobile Edge Computing," Future Internet, MDPI, vol. 17(6), pages 1-20, June.
    2. Li, Jianping & Ge, Yu & He, Shuai & Lichen, Junran, 2014. "Approximation algorithms for constructing some required structures in digraphs," European Journal of Operational Research, Elsevier, vol. 232(2), pages 307-314.
    3. Shisheng Li & T.C.E. Cheng & C.T. Ng & Jinjiang Yuan, 2017. "Two‐agent scheduling on a single sequential and compatible batching machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 628-641, December.
    4. Polinder, G.-J. & Cacchiani, V. & Schmidt, M.E. & Huisman, D., 2020. "An iterative heuristic for passenger-centric train timetabling with integrated adaption times," ERIM Report Series Research in Management ERS-2020-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    5. Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
    6. Jianping Li & Juanping Zhu, 2013. "The Capacity Expansion Path Problem in Networks," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    7. Li Guan & Jianping Li & Weidong Li & Junran Lichen, 2019. "Improved approximation algorithms for the combination problem of parallel machine scheduling and path," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 689-697, October.
    8. Polinder, G.-J. & Schmidt, M.E. & Huisman, D., 2020. "Timetabling for strategic passenger railway planning," ERIM Report Series Research in Management ERS-2020-001-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. Hartleb, Johann & Schmidt, Marie, 2022. "Railway timetabling with integrated passenger distribution," European Journal of Operational Research, Elsevier, vol. 298(3), pages 953-966.
    10. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    11. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    12. Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2010. "Complexity of single machine scheduling subject to nonnegative inventory constraints," European Journal of Operational Research, Elsevier, vol. 207(2), pages 605-619, December.
    13. M. Reza Khani & Mohammad R. Salavatipour, 2016. "Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 669-685, February.
    14. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    15. Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
    16. Hartleb, J. & Schmidt, M.E. & Friedrich, M. & Huisman, D., 2019. "A good or a bad timetable: Do different evaluation functions agree?," ERIM Report Series Research in Management ERS-2019-002-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. Boaz Golany & Moshe Kress & Michal Penn & Uriel G. Rothblum, 2012. "Network Optimization Models for Resource Allocation in Developing Military Countermeasures," Operations Research, INFORMS, vol. 60(1), pages 48-63, February.
    18. Xie, J. & Wong, S.C. & Zhan, S. & Lo, S.M. & Chen, Anthony, 2020. "Train schedule optimization based on schedule-based stochastic passenger assignment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    19. Amir Elalouf, 2014. "Fast approximation algorithms for routing problems with hop-wise constraints," Annals of Operations Research, Springer, vol. 222(1), pages 279-291, November.
    20. Philine Schiewe & Marc Goerigk & Niels Lindner, 2023. "Introducing TimPassLib – A Library for Integrated Periodic Timetabling and Passenger Routing," SN Operations Research Forum, Springer, vol. 4(3), pages 1-14, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:inm:ortrsc:v:56:y:2022:i:6:p:1432-1451. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.