IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v153y2021ics1366554521001939.html
   My bibliography  Save this article

An improved learning-and-optimization train fare design method for addressing commuting congestion at CBD stations

Author

Listed:
  • Chen, Xinyuan
  • Zhang, Wei
  • Guo, Xiaomeng
  • Liu, Zhiyuan
  • Wang, Shuaian

Abstract

This study proposes an improved learning-and-optimization train fare design method to deal with the commuting congestion of train stations at the central business district (CBD). The conventional learning-and-optimization scheme needs accurate boarding/alighting demand to update the train fare in each trial. However, when congestion happens, the observed boarding/alighting demand will be larger than the actual boarding/alighting demand due to the delays and the longer dwelling time. Thus, the actual boarding/alighting demand is not available in practice. The improved algorithm deals with this issue by using inexact and less information to determine the new trial fare during the iteration. Namely, the improved method bypasses the conditions that may lead to biased results so as to significantly enhance the reliability of the learning-and-optimization method. The simplified algorithm also makes this method more practical. The convergence property of the proposed algorithm is rigorously proved and the convergence rate is demonstrated to be exponential. Numerical studies are performed to demonstrate the efficiency of the improved learning-and-optimization method.

Suggested Citation

  • Chen, Xinyuan & Zhang, Wei & Guo, Xiaomeng & Liu, Zhiyuan & Wang, Shuaian, 2021. "An improved learning-and-optimization train fare design method for addressing commuting congestion at CBD stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
  • Handle: RePEc:eee:transe:v:153:y:2021:i:c:s1366554521001939
    DOI: 10.1016/j.tre.2021.102427
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554521001939
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2021.102427?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. Ren-Yong Guo & Hai Yang & Hai-Jun Huang & Zhijia Tan, 2016. "Day-to-Day Flow Dynamics and Congestion Control," Transportation Science, INFORMS, vol. 50(3), pages 982-997, August.
    2. Bojian Zhou & Min Xu & Yong Zhang, 2019. "A Trial-and-Error Congestion Pricing Method for Day-to-Day Dynamic Network Flows considering Travelers’ Heterogeneous Inertia Patterns," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-17, November.
    3. Wu, Jiaming & Kulcsár, Balázs & Ahn, Soyoung & Qu, Xiaobo, 2020. "Emergency vehicle lane pre-clearing: From microscopic cooperation to routing decision making," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 223-239.
    4. Yang, Hai & Meng, Qiang & Lee, Der-Horng, 2004. "Trial-and-error implementation of marginal-cost pricing on networks in the absence of demand functions," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 477-493, July.
    5. Guo, Xiaolei & Xu, Da, 2016. "Profit maximization by a private toll road with cars and trucks," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 113-129.
    6. Deren Han & Wei Xu & Hai Yang, 2010. "Solving a class of variational inequalities with inexact oracle operators," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(3), pages 427-452, June.
    7. Ye, Hongbo & Yang, Hai & Tan, Zhijia, 2015. "Learning marginal-cost pricing via a trial-and-error procedure with day-to-day flow dynamics," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 794-807.
    8. Qu, Xiaobo & Yu, Yang & Zhou, Mofan & Lin, Chin-Teng & Wang, Xiangyu, 2020. "Jointly dampening traffic oscillations and improving energy consumption with electric, connected and automated vehicles: A reinforcement learning based approach," Applied Energy, Elsevier, vol. 257(C).
    9. Li, Michael Z. F., 2002. "The role of speed-flow relationship in congestion pricing implementation with an application to Singapore," Transportation Research Part B: Methodological, Elsevier, vol. 36(8), pages 731-754, September.
    10. Wang, Xiaolei & Yang, Hai, 2012. "Bisection-based trial-and-error implementation of marginal cost pricing and tradable credit scheme," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1085-1096.
    11. Han, Deren & Yang, Hai, 2009. "Congestion pricing in the absence of demand functions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 159-171, January.
    12. Zhou, Bojian & Bliemer, Michiel & Yang, Hai & He, Jie, 2015. "A trial-and-error congestion pricing scheme for networks with elastic demand and link capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 77-92.
    13. Wang, Shuaian & Zhang, Wei & Qu, Xiaobo, 2018. "Trial-and-error train fare design scheme for addressing boarding/alighting congestion at CBD stations," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 318-335.
    14. Xu, Yueru & Zheng, Yuan & Yang, Ying, 2021. "On the movement simulations of electric vehicles: A behavioral model-based approach," Applied Energy, Elsevier, vol. 283(C).
    15. Qiang Meng & Zhiyuan Liu, 2011. "Trial-and-error method for congestion pricing scheme under side-constrained probit-based stochastic user equilibrium conditions," Transportation, Springer, vol. 38(5), pages 819-843, September.
    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. Ye, Jiao & Jiang, Yu & Chen, Jun & Liu, Zhiyuan & Guo, Renzhong, 2021. "Joint optimisation of transfer location and capacity for a capacitated multimodal transport network with elastic demand: a bi-level programming model and paradoxes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    2. Luetian Sun & Rui Song, 2022. "Improving Efficiency in Congested Traffic Networks: Pareto-Improving Reservations through Agent-Based Timetabling," Sustainability, MDPI, vol. 14(4), pages 1-24, February.
    3. Xu, Guangming & Liu, Yihan & Gao, Yihan & Liu, Wei, 2023. "Integrated optimization of train stopping plan and seat allocation scheme for railway systems under equilibrium travel choice and elastic demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(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. Xinyuan Chen & Yiran Wang & Yuan Zhang, 2021. "A Trial-and-Error Toll Design Method for Traffic Congestion Mitigation on Large River-Crossing Channels in a Megacity," Sustainability, MDPI, vol. 13(5), pages 1-13, March.
    2. Guo, Ren-Yong & Szeto, W.Y. & Long, Jiancheng, 2020. "Trial-and-error operation schemes for bimodal transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 106-123.
    3. Ren-Yong Guo & Hai-Jun Huang & Hai Yang, 2019. "Tradable Credit Scheme for Control of Evolutionary Traffic Flows to System Optimum: Model and its Convergence," Networks and Spatial Economics, Springer, vol. 19(3), pages 833-868, September.
    4. Lie Han, 2022. "Proportional-Switch Adjustment Process with Elastic Demand and Congestion Toll in the Absence of Demand Functions," Networks and Spatial Economics, Springer, vol. 22(4), pages 709-735, December.
    5. Liu, Renming & Jiang, Yu & Seshadri, Ravi & Ben-Akiva, Moshe & Azevedo, Carlos Lima, 2024. "Contextual Bayesian optimization of congestion pricing with day-to-day dynamics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 179(C).
    6. Wang, Shuaian & Zhang, Wei & Qu, Xiaobo, 2018. "Trial-and-error train fare design scheme for addressing boarding/alighting congestion at CBD stations," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 318-335.
    7. Ye, Hongbo & Yang, Hai & Tan, Zhijia, 2015. "Learning marginal-cost pricing via a trial-and-error procedure with day-to-day flow dynamics," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 794-807.
    8. Farokhi, Farhad & Johansson, Karl H., 2015. "A piecewise-constant congestion taxing policy for repeated routing games," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 123-143.
    9. Wang, Xiaolei & Yang, Hai, 2012. "Bisection-based trial-and-error implementation of marginal cost pricing and tradable credit scheme," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1085-1096.
    10. Liang, Qingnan & Li, Xin-an & Chen, Zhibin & Pan, Tianlu & Zhong, Renxin, 2023. "Day-to-day traffic control for networks mixed with regular human-piloted and connected autonomous vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
    11. Ren-Yong Guo & Hai Yang & Hai-Jun Huang & Zhijia Tan, 2016. "Day-to-Day Flow Dynamics and Congestion Control," Transportation Science, INFORMS, vol. 50(3), pages 982-997, August.
    12. Zhou, Bojian & Bliemer, Michiel & Yang, Hai & He, Jie, 2015. "A trial-and-error congestion pricing scheme for networks with elastic demand and link capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 77-92.
    13. Qixiu Cheng & Zhiyuan Liu & Feifei Liu & Ruo Jia, 2017. "Urban dynamic congestion pricing: an overview and emerging research needs," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 21(0), pages 3-18, August.
    14. Xinyuan Chen & Ruyang Yin & Qinhe An & Yuan Zhang, 2021. "Modeling a Distance-Based Preferential Fare Scheme for Park-and-Ride Services in a Multimodal Transport Network," Sustainability, MDPI, vol. 13(5), pages 1-14, March.
    15. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    16. Ren-Yong Guo & Hai Yang & Hai-Jun Huang, 2018. "Are We Really Solving the Dynamic Traffic Equilibrium Problem with a Departure Time Choice?," Transportation Science, INFORMS, vol. 52(3), pages 603-620, June.
    17. Huo, Jinbiao & Liu, Zhiyuan & Chen, Jingxu & Cheng, Qixiu & Meng, Qiang, 2023. "Bayesian optimization for congestion pricing problems: A general framework and its instability," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 1-28.
    18. Qixiu Cheng & Jun Chen & Honggang Zhang & Zhiyuan Liu, 2021. "Optimal Congestion Pricing with Day-to-Day Evolutionary Flow Dynamics: A Mean–Variance Optimization Approach," Sustainability, MDPI, vol. 13(9), pages 1-15, April.
    19. Hongbo Ye & Hai Yang, 2017. "Rational Behavior Adjustment Process with Boundedly Rational User Equilibrium," Transportation Science, INFORMS, vol. 51(3), pages 968-980, August.
    20. Mamdoohi, Sohrab & Miller-Hooks, Elise & Gifford, Jonathan, 2023. "An equilibrium approach for compensating public–private partnership concessionaires for reduced tolls during roadway maintenance," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).

    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:eee:transe:v:153:y:2021:i:c:s1366554521001939. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.