IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v173y2023icp31-58.html
   My bibliography  Save this article

Time and toll trade-off with heterogeneous users: A continuous time surplus maximization bi-objective user equilibrium model

Author

Listed:
  • Xu, Zhandong
  • Chen, Anthony
  • Liu, Xiaobo

Abstract

This paper presents a continuous time surplus maximization bi-objective user equilibrium (C-TSmaxBUE) model, in which the users’ variability toward the time and toll trade-off in a tolled road network is explicitly considered. Different users are assigned with different ratios of the time saved per unit of money (RTSMs), the values of which represent the different expectations to trade more money for less travel time. Infinite indifference curves are then generated by considering continuously distributed RTSMs in the population. Accordingly, we extend the definition of the path-based time surplus for the C-TSmaxBUE model, which can be formulated as a Beckmann-type mathematical program operating in the space of RTSM boundaries. To solve the problem, we develop a path-based single-boundary adjustment (SBA) algorithm that fits the non-additive structure of the model. The algorithm involves a Newton-type flow equilibration procedure that simultaneously adjusts RTSM boundaries and path flows, as well as a column generation scheme that firstly enumerates all efficient paths and then identifies the paths that have the potential to reduce generalized travel times. Numerical results on a small network show the feature of the equilibrium flow pattern, whereas instances of practical size confirm that SBA is an efficient tool to obtain high-quality equilibrium solutions. Compared to the original TSmaxBUE problem, we found that a larger set of efficient paths will be used when the users’ heterogeneity is considered.

Suggested Citation

  • Xu, Zhandong & Chen, Anthony & Liu, Xiaobo, 2023. "Time and toll trade-off with heterogeneous users: A continuous time surplus maximization bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 31-58.
    • Handle: RePEc:eee:transb:v:173:y:2023:i:c:p:31-58
    DOI: 10.1016/j.trb.2023.04.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S019126152300070X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2023.04.007?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. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    2. Steven A. Gabriel & David Bernstein, 1997. "The Traffic Equilibrium Problem with Nonadditive Path Costs," Transportation Science, INFORMS, vol. 31(4), pages 337-348, November.
    3. Judith Y. T. Wang & Andrea Raith & Matthias Ehrgott, 2010. "Tolling Analysis with Bi-objective Traffic Assignment," Lecture Notes in Economics and Mathematical Systems, in: Matthias Ehrgott & Boris Naujoks & Theodor J. Stewart & Jyrki Wallenius (ed.), Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, pages 117-129, Springer.
    4. Lo, Hong K. & Luo, X.W. & Siu, Barbara W.Y., 2006. "Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion," Transportation Research Part B: Methodological, Elsevier, vol. 40(9), pages 792-806, November.
    5. Andrea Raith & Judith Wang & Matthias Ehrgott & Stuart Mitchell, 2014. "Solving multi-objective traffic assignment," Annals of Operations Research, Springer, vol. 222(1), pages 483-516, November.
    6. Robert B. Dial, 1999. "Network-Optimized Road Pricing: Part II: Algorithms and Examples," Operations Research, INFORMS, vol. 47(2), pages 327-336, April.
    7. Robert B. Dial, 1999. "Network-Optimized Road Pricing: Part I: A Parable and a Model," Operations Research, INFORMS, vol. 47(1), pages 54-64, February.
    8. Tan, Zhijia & Yang, Hai, 2012. "The impact of user heterogeneity on road franchising," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 958-975.
    9. Carlos F. Daganzo, 1983. "Stochastic Network Equilibrium with Multiple Vehicle Types and Asymmetric, Indefinite Link Cost Jacobians," Transportation Science, INFORMS, vol. 17(3), pages 282-300, August.
    10. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    11. Jayakrishnan, R. & Tsai, Wei T. & Prashker, Joseph N. & Rajadhyaksha, Subodh, 1994. "A Faster Path-Based Algorithm for Traffic Assignment," University of California Transportation Center, Working Papers qt2hf4541x, University of California Transportation Center.
    12. Meng, Qiang & Liu, Zhiyuan & Wang, Shuaian, 2012. "Optimal distance tolls under congestion pricing and continuously distributed value of time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 937-957.
    13. Ehrgott, Matthias & Wang, Judith Y.T. & Raith, Andrea & van Houtte, Chris, 2012. "A bi-objective cyclist route choice model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(4), pages 652-663.
    14. Huang, Hai-Jun & Li, Zhi-Chun, 2007. "A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1464-1477, February.
    15. Leurent, Fabien, 1993. "Cost versus time equilibrium over a network," European Journal of Operational Research, Elsevier, vol. 71(2), pages 205-221, December.
    16. Robert B. Dial, 1996. "Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms," Transportation Science, INFORMS, vol. 30(2), pages 93-111, May.
    17. Dial, Robert B., 1979. "A model and algorithm for multicriteria route-mode choice," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 311-316, December.
    18. Chen, Anthony & Lee, Der-Horng & Jayakrishnan, R., 2002. "Computational study of state-of-the-art path-based traffic assignment algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 59(6), pages 509-518.
    19. Yang, Hai & Huang, Hai-Jun, 2004. "The multi-class, multi-criteria traffic network equilibrium and systems optimum problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 1-15, January.
    20. Ehrgott, Matthias & Wang, Judith Y.T. & Watling, David P., 2015. "On multi-objective stochastic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 704-717.
    21. Wang, Judith Y.T. & Ehrgott, Matthias, 2013. "Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 342-360.
    22. Chi Xie & Xing Wu & Stephen Boyles, 2019. "Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account," Annals of Operations Research, Springer, vol. 273(1), pages 279-310, February.
    23. Hongli Xu & Hai Yang & Jing Zhou & Yafeng Yin, 2017. "A Route Choice Model with Context-Dependent Value of Time," Transportation Science, INFORMS, vol. 51(2), pages 536-548, May.
    24. Liu, Yang & Nie, Yu (Marco) & Hall, Jonathan, 2015. "A semi-analytical approach for solving the bottleneck model with general user heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 56-70.
    25. 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).
    26. Perederieieva, Olga & Raith, Andrea & Schmidt, Marie, 2018. "Non-additive shortest path in the context of traffic assignment," European Journal of Operational Research, Elsevier, vol. 268(1), pages 325-338.
    27. Lo, Hong K. & Chen, Anthony, 2000. "Traffic equilibrium problem with route-specific costs: formulation and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 34(6), pages 493-513, August.
    28. Dial, Robert B., 1997. "Bicriterion traffic assignment: Efficient algorithms plus examples," Transportation Research Part B: Methodological, Elsevier, vol. 31(5), pages 357-379, October.
    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. Tan, Heqing & Xu, Xiangdong & Chen, Anthony, 2024. "On endogenously distinguishing inactive paths in stochastic user equilibrium: A convex programming approach with a truncated path choice model," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    2. Li, Guoyuan & Chen, Anthony & Ryu, Seungkyu & Kitthamkesorn, Songyot & Xu, Xiangdong, 2024. "Modeling elasticity, similarity, stochasticity, and congestion in a network equilibrium framework using a paired combinatorial weibit choice model," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    3. Xu, Zhandong & Chen, Anthony & Li, Guoyuan & Li, Zhengyang & Liu, Xiaobo, 2024. "Elastic-demand bi-criteria traffic assignment under the continuously distributed value of time: A two-stage gradient projection algorithm with graphical interpretations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(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. Wang, Guangchao & Jia, Ning & Ma, Shoufeng & Qi, Hang, 2014. "A rank-dependent bi-criterion equilibrium model for stochastic transportation environment," European Journal of Operational Research, Elsevier, vol. 235(3), pages 511-529.
    2. Chi Xie & Xing Wu & Stephen Boyles, 2019. "Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account," Annals of Operations Research, Springer, vol. 273(1), pages 279-310, February.
    3. Hongli Xu & Hai Yang & Jing Zhou & Yafeng Yin, 2017. "A Route Choice Model with Context-Dependent Value of Time," Transportation Science, INFORMS, vol. 51(2), pages 536-548, May.
    4. Wang, Judith Y.T. & Ehrgott, Matthias, 2013. "Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 342-360.
    5. Ehrgott, Matthias & Wang, Judith Y.T. & Watling, David P., 2015. "On multi-objective stochastic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 704-717.
    6. Andrea Raith & Judith Wang & Matthias Ehrgott & Stuart Mitchell, 2014. "Solving multi-objective traffic assignment," Annals of Operations Research, Springer, vol. 222(1), pages 483-516, November.
    7. Xu, Zhandong & Chen, Anthony & Li, Guoyuan & Li, Zhengyang & Liu, Xiaobo, 2024. "Elastic-demand bi-criteria traffic assignment under the continuously distributed value of time: A two-stage gradient projection algorithm with graphical interpretations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    8. O’Neill, Sam & Bagdasar, Ovidiu & Berry, Stuart & Popovici, Nicolae & Raja, Ramachandran, 2022. "Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 201(C), pages 658-669.
    9. Wu, Wen-Xiang & Huang, Hai-Jun, 2014. "Finding anonymous tolls to realize target flow pattern in networks with continuously distributed value of time," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 31-46.
    10. Hong, Sung-Pil & Kim, Kyung min & Byeon, Geunyeong & Min, Yun-Hong, 2017. "A method to directly derive taste heterogeneity of travellers’ route choice in public transport from observed routes," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 41-52.
    11. Ding, Hongxing & Yang, Hai & Xu, Hongli & Li, Ting, 2023. "Status quo-dependent user equilibrium model with adaptive value of time," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 77-90.
    12. Feng Xiao & H. M. Zhang, 2014. "Pareto-Improving and Self-Sustainable Pricing for the Morning Commute with Nonidentical Commuters," Transportation Science, INFORMS, vol. 48(2), pages 159-169, May.
    13. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    14. Wang, Judith Y.T. & Ehrgott, Matthias & Chen, Anthony, 2014. "A bi-objective user equilibrium model of travel time reliability in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 4-15.
    15. Siu, Barbara W.Y. & Lo, Hong K., 2008. "Doubly uncertain transportation network: Degradable capacity and stochastic demand," European Journal of Operational Research, Elsevier, vol. 191(1), pages 166-181, November.
    16. Yang, Hai & Tang, Wilson H. & Man Cheung, Wing & Meng, Qiang, 2002. "Profitability and welfare gain of private toll roads in a network with heterogeneous users," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(6), pages 537-554, July.
    17. Chen, Peng & Nie, Yu (Marco), 2013. "Bicriterion shortest path problem with a general nonadditive cost," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 419-435.
    18. Danczyk, Adam & Di, Xuan & Liu, Henry X. & Levinson, David M., 2017. "Unexpected versus expected network disruption: Effects on travel behavior," Transport Policy, Elsevier, vol. 57(C), pages 68-78.
    19. Dung-Ying Lin & Chi Xie, 2011. "The Pareto-optimal Solution Set of the Equilibrium Network Design Problem with Multiple Commensurate Objectives," Networks and Spatial Economics, Springer, vol. 11(4), pages 727-751, December.
    20. Zhang, Xiaoning & Yang, Hai & Huang, Hai-Jun, 2008. "Multiclass multicriteria mixed equilibrium on networks and uniform link tolls for system optimum," European Journal of Operational Research, Elsevier, vol. 189(1), pages 146-158, 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:eee:transb:v:173:y:2023:i:c:p:31-58. 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/548/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.