IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v273y2019i1d10.1007_s10479-018-2990-0.html
   My bibliography  Save this article

Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account

Author

Listed:
  • Chi Xie

    (Tongji University
    Tongji University)

  • Xing Wu

    (Lamar University)

  • Stephen Boyles

    (University of Texas at Austin)

Abstract

A new traffic network equilibrium problem with continuously distributed bounds on path weights is introduced in this paper, as an emerging modeling tool for evaluating traffic networks in which the route choice behavior of individual motorists is subject to some physical or psychological upper limit of a travel weight. Such a problem may arise from at least two traffic network instances. First, in a traffic network serving electric vehicles, the driving range of these vehicles is subject to a distance constraint formed by onboard battery capacities and electricity consumption rates as well as network-wide battery-recharging opportunities, which cause the range anxiety issue in the driving population. Second, in a tolled traffic network, while drivers take into account both travel time and road toll in their route choice decisions, many of them implicitly or explicitly set a budget constraint in their mental account for toll expense, subject to their own income levels and other personal and household socio-economic factors. In both cases, we model the upper limit of the path travel weight (i.e., distance or toll) as a continuously distributed stochastic parameter across the driving population, to reflect the diverse heterogeneity of vehicle- and/or motorist-related travel characteristics. For characterizing this weight-constrained network equilibrium problem, we proposed a convex programming model with a finite number of constraints, on the basis of a newly introduced path flow variable named interval path flow rate. We also analyzed the problem’s optimality conditions for the case of path distance limits, and studied the existence of optimal tolls for the case of path toll limits. A linear approximation algorithm was further developed for this complex network equilibrium problem, which encapsulates an efficient weight-constrained k-minimum time path search procedure to perform the network loading. Numerical results obtained from conducting quantitative analyses on example networks clearly illustrate the applicability of the modeling and solution methods for the proposed problem and reveal the mechanism of stochastic weight limits reshaping the network equilibrium.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:273:y:2019:i:1:d:10.1007_s10479-018-2990-0
    DOI: 10.1007/s10479-018-2990-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2990-0
    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/s10479-018-2990-0?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. Steven A. Gabriel & David Bernstein, 1997. "The Traffic Equilibrium Problem with Nonadditive Path Costs," Transportation Science, INFORMS, vol. 31(4), pages 337-348, November.
    2. Thaler, Richard H, 1990. "Saving, Fungibility, and Mental Accounts," Journal of Economic Perspectives, American Economic Association, vol. 4(1), pages 193-205, Winter.
    3. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
    4. Verhoef, Erik T., 2002. "Second-best congestion pricing in general static transportation networks with elastic demands," Regional Science and Urban Economics, Elsevier, vol. 32(3), pages 281-310, May.
    5. Richard H. Thaler, 2008. "Mental Accounting and Consumer Choice," Marketing Science, INFORMS, vol. 27(1), pages 15-25, 01-02.
    6. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    7. Xie, Chi & Wang, Tong-Gen & Pu, Xiaoting & Karoonsoontawong, Ampol, 2017. "Path-constrained traffic assignment: Modeling and computing network impacts of stochastic range anxiety," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 136-157.
    8. Larsson, Torbjörn & Patriksson, Michael, 1995. "An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 29(6), pages 433-455, December.
    9. (Jeff) Ban, Xuegang & Ferris, Michael C. & Tang, Lisa & Lu, Shu, 2013. "Risk-neutral second best toll pricing," Transportation Research Part B: Methodological, Elsevier, vol. 48(C), pages 67-87.
    10. 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.
    11. 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.
    12. Gulipalli, Pradeep K. & Kockelman, Kara M., 2008. "Credit-based congestion pricing: A Dallas-Fort Worth application," Transport Policy, Elsevier, vol. 15(1), pages 23-32, January.
    13. Larsson, Torbjörn & Patriksson, Michael, 1999. "Side constrained traffic equilibrium models-- analysis, computation and applications," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 233-264, May.
    14. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    15. Nie, Yu & Zhang, H. M. & Lee, Der-Horng, 2004. "Models and algorithms for the traffic assignment problem with link capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 285-312, May.
    16. Batarce, Marco & Ivaldi, Marc, 2014. "Urban travel demand model with endogenous congestion," Transportation Research Part A: Policy and Practice, Elsevier, vol. 59(C), pages 331-345.
    17. Zhenhong Lin, 2014. "Optimizing and Diversifying Electric Vehicle Driving Range for U.S. Drivers," Transportation Science, INFORMS, vol. 48(4), pages 635-650, November.
    18. Marguerite Frank & Philip Wolfe, 1956. "An algorithm for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 95-110, March.
    19. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2001. "A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network," Transportation Science, INFORMS, vol. 35(4), pages 345-358, November.
    20. Yang, Hai & Wang, Xiaolei & Yin, Yafeng, 2012. "The impact of speed limits on traffic equilibrium and system performance in networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1295-1307.
    21. 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.
    22. Robert B. Dial, 1999. "Network-Optimized Road Pricing: Part II: Algorithms and Examples," Operations Research, INFORMS, vol. 47(2), pages 327-336, April.
    23. Robert B. Dial, 1996. "Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms," Transportation Science, INFORMS, vol. 30(2), pages 93-111, May.
    24. Verhoef, Erik T., 2002. "Second-best congestion pricing in general networks. Heuristic algorithms for finding second-best optimal toll levels and toll points," Transportation Research Part B: Methodological, Elsevier, vol. 36(8), pages 707-729, September.
    25. 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.
    26. Franke, Thomas & Krems, Josef F., 2013. "What drives range preferences in electric vehicle users?," Transport Policy, Elsevier, vol. 30(C), pages 56-62.
    27. Mokhtarian, Patricia L. & Chen, Cynthia, 2004. "TTB or not TTB, that is the question: a review and analysis of the empirical literature on travel time (and money) budgets," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(9-10), pages 643-675.
    28. He, Fang & Yin, Yafeng & Lawphongpanich, Siriphong, 2014. "Network equilibrium models with battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 306-319.
    29. Zhang, H. M. & Ge, Y. E., 2004. "Modeling variable demand equilibrium under second-best road pricing," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 733-749, September.
    30. Leurent, Fabien, 1993. "Cost versus time equilibrium over a network," European Journal of Operational Research, Elsevier, vol. 71(2), pages 205-221, December.
    31. H. Yang & S.C. Wong, 1999. "Estimation of the most likely equilibrium traffic queueing pattern in a capacityconstrained network," Annals of Operations Research, Springer, vol. 87(0), pages 73-85, April.
    32. Larry J. LeBlanc & Richard V. Helgason & David E. Boyce, 1985. "Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs," Transportation Science, INFORMS, vol. 19(4), pages 445-462, November.
    33. Y. Arezki & D. Van Vliet, 1990. "A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment," Transportation Science, INFORMS, vol. 24(1), pages 58-62, February.
    34. 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.
    35. 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. 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.
    2. Zhongwei Chen & Zhi-Ping Fan, 2023. "Improvement strategies of battery driving range in an electric vehicle supply chain considering subsidy threshold and cost misreporting," Annals of Operations Research, Springer, vol. 326(1), pages 89-113, July.
    3. Anders F. Jensen & Thomas K. Rasmussen & Carlo G. Prato, 2020. "A Route Choice Model for Capturing Driver Preferences When Driving Electric and Conventional Vehicles," Sustainability, MDPI, vol. 12(3), pages 1-18, February.

    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. 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.
    2. 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.
    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. 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.
    5. 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.
    6. 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.
    7. Cipriani, Ernesto & Mannini, Livia & Montemarani, Barbara & Nigro, Marialisa & Petrelli, Marco, 2019. "Congestion pricing policies: Design and assessment for the city of Rome, Italy," Transport Policy, Elsevier, vol. 80(C), pages 127-135.
    8. (Jeff) Ban, Xuegang & Ferris, Michael C. & Tang, Lisa & Lu, Shu, 2013. "Risk-neutral second best toll pricing," Transportation Research Part B: Methodological, Elsevier, vol. 48(C), pages 67-87.
    9. 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.
    10. 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.
    11. Xiang Zhang & David Rey & S. Travis Waller & Nathan Chen, 2019. "Range-Constrained Traffic Assignment with Multi-Modal Recharge for Electric Vehicles," Networks and Spatial Economics, Springer, vol. 19(2), pages 633-668, June.
    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. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    14. 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.
    15. Patrice Marcotte & Anne Mercier & Gilles Savard & Vedat Verter, 2009. "Toll Policies for Mitigating Hazardous Materials Transport Risk," Transportation Science, INFORMS, vol. 43(2), pages 228-243, May.
    16. Abdelfettah Laouzai & Rachid Ouafi, 2022. "A prediction model for atmospheric pollution reduction from urban traffic," Environment and Planning B, , vol. 49(2), pages 566-584, February.
    17. 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.
    18. Jahn, Olaf & Möhring, Rolf & Schulz, Andreas & Stier Moses, Nicolás, 2004. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Working papers 4394-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    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. Luan, Mingye & Waller, S.Travis & Rey, David, 2023. "A non-additive path-based reward credit scheme for traffic congestion management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(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:spr:annopr:v:273:y:2019:i:1:d:10.1007_s10479-018-2990-0. 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.