IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v12y2020i3d10.1007_s12469-020-00239-9.html
   My bibliography  Save this article

Route choice effects of changes from a zonal to a distance-based fare structure in a regional public transport network

Author

Listed:
  • Saeed Maadi

    (University of Glasgow
    Damghan University)

  • Jan-Dirk Schmöcker

    (Kyoto University)

Abstract

By using a hypothetical transport network that reflects common origin and destination relations in a regional transport network, we illustrate the effects of changing fares from a zonal to a distance-based structure. We take the zonal fare as a base case and model the effect of different fare/km, including non-additive fares, where the marginal price per km is decreasing with a typical regional network. We restrict our analysis to a fixed total demand and consider the effects of fares on route choice including station access choice and walking to nearby destinations. The results indicate some general trends that can be expected, such as the fare range in order to achieve similar fare revenue incomes. At this fare parity point the total travel time tends to be reduced in the distance-based case but the flows become less dispersed. Furthermore, in case of a non-additive distance-based fare, we show that total utility could be improved at the fare parity point compared to additive fares.

Suggested Citation

  • Saeed Maadi & Jan-Dirk Schmöcker, 2020. "Route choice effects of changes from a zonal to a distance-based fare structure in a regional public transport network," Public Transport, Springer, vol. 12(3), pages 535-555, October.
    • Handle: RePEc:spr:pubtra:v:12:y:2020:i:3:d:10.1007_s12469-020-00239-9
    DOI: 10.1007/s12469-020-00239-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-020-00239-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12469-020-00239-9?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.

    References listed on IDEAS

    as
    1. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    2. Farber, Steven & Bartholomew, Keith & Li, Xiao & Páez, Antonio & Nurul Habib, Khandker M., 2014. "Assessing social equity in distance based transit fares using a model of travel behavior," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 291-303.
    3. Daganzo, Carlos F., 2010. "Structure of competitive transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 434-446, May.
    4. Jan-Dirk Schmöcker & Michael G.H. Bell & Fumitaka Kurauchi & Hiroshi Shimamoto, 2009. "A Game Theoretic Approach to the Determination of Hyperpaths in Transportation Networks," Springer Books, in: William H. K. Lam & S. C. Wong & Hong K. Lo (ed.), Transportation and Traffic Theory 2009: Golden Jubilee, chapter 0, pages 1-18, Springer.
    5. Finn Jørgensen & John Preston, 2007. "The Relationship Between Fare and Travel Distance," Journal of Transport Economics and Policy, University of Bath, vol. 41(3), pages 451-468, September.
    6. Lo, Hong K. & Yip, C. W. & Wan, K. H., 2003. "Modeling transfer and non-linear fare structure in multi-modal network," Transportation Research Part B: Methodological, Elsevier, vol. 37(2), pages 149-170, February.
    7. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    8. Mackie, P.J. & Jara-Díaz, S. & Fowkes, A.S., 0. "The value of travel time savings in evaluation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 37(2-3), pages 91-106, April.
    9. Jin, Zhihua & Schmöcker, Jan-Dirk & Maadi, Saeed, 2019. "On the interaction between public transport demand, service quality and fare for social welfare optimisation," Research in Transportation Economics, Elsevier, vol. 76(C).
    10. Daskin, Mark S. & Schofer, Joseph L. & Haghani, Ali E., 1988. "A quadratic programming model for designing and evaluating distance-based and zone fares for urban transit," Transportation Research Part B: Methodological, Elsevier, vol. 22(1), pages 25-44, February.
    11. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Simic, Vladimir & Gokasar, Ilgin & Deveci, Muhammet & Karakurt, Ahmet, 2022. "An integrated CRITIC and MABAC based type-2 neutrosophic model for public transportation pricing system selection," Socio-Economic Planning Sciences, Elsevier, vol. 80(C).

    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. Huang, Di & Liu, Zhiyuan & Liu, Pan & Chen, Jun, 2016. "Optimal transit fare and service frequency of a nonlinear origin-destination based fare structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 1-19.
    2. Bell, Michael G.H. & Trozzi, Valentina & Hosseinloo, Solmaz Haji & Gentile, Guido & Fonzone, Achille, 2012. "Time-dependent Hyperstar algorithm for robust vehicle navigation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(5), pages 790-800.
    3. Ren, Hualing & Song, Yingjie & Long, Jiancheng & Si, Bingfeng, 2021. "A new transit assignment model based on line and node strategies," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 121-142.
    4. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    5. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.
    6. Kenetsu Uchida & Agachai Sumalee & David Watling & Richard Connors, 2007. "A Study on Network Design Problems for Multi-modal Networks by Probit-based Stochastic User Equilibrium," Networks and Spatial Economics, Springer, vol. 7(3), pages 213-240, September.
    7. Jiang, Y. & Szeto, W.Y., 2016. "Reliability-based stochastic transit assignment: Formulations and capacity paradox," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 181-206.
    8. Javier Durán-Micco & Pieter Vansteenwegen, 2022. "A survey on the transit network design and frequency setting problem," Public Transport, Springer, vol. 14(1), pages 155-190, March.
    9. Zhi-Chun Li & William Lam & S. Wong, 2009. "The Optimal Transit Fare Structure under Different Market Regimes with Uncertainty in the Network," Networks and Spatial Economics, Springer, vol. 9(2), pages 191-216, June.
    10. Li, Qianfei & (Will) Chen, Peng & (Marco) Nie, Yu, 2015. "Finding optimal hyperpaths in large transit networks with realistic headway distributions," European Journal of Operational Research, Elsevier, vol. 240(1), pages 98-108.
    11. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    12. Ding Luo & Oded Cats & Hans Lint, 2020. "Can passenger flow distribution be estimated solely based on network properties in public transport systems?," Transportation, Springer, vol. 47(6), pages 2757-2776, December.
    13. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
    14. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    15. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.
    16. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    17. Hamdouch, Younes & Lawphongpanich, Siriphong, 2008. "Schedule-based transit assignment model with travel strategies and capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 663-684, August.
    18. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    19. Amirali Zarrinmehr & Mahmoud Saffarzadeh & Seyedehsan Seyedabrishami & Yu Marco Nie, 2016. "A path-based greedy algorithm for multi-objective transit routes design with elastic demand," Public Transport, Springer, vol. 8(2), pages 261-293, September.
    20. Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, August.

    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:pubtra:v:12:y:2020:i:3:d:10.1007_s12469-020-00239-9. 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: 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.