Advertisement

Bounding the Inefficiency of the Reliability-Based Continuous Network Design Problem Under Cost Recovery

  • Anny B. Wang
  • W. Y. SzetoEmail author
Article
  • 53 Downloads

Abstract

This study defines the price of anarchy for general reliability-based transport network design problems, which is an indicator of inefficiency that reveals how much the design objective value exceeds its theoretical minimum value due to the risk averse and selfish routing behavior of travelers. This study examines a new problem, which is a reliability-based continuous network design problem under cost recovery. In this problem, the variations of system travel time and path travel times, the risk attitudes of the system manager and travelers, congestion toll charges, capacity expansions, and cost recovery constraint are explicitly considered. The design problem is formulated as a min-max problem with the reliability-based user equilibrium constraint. It is proved that the price of anarchy for this problem is bounded above, and the upper bound is independent of travel time functions, demands, and network topology. The upper bound is related to the travel time variations, the value of reliability, and the value of time.

Keywords

Inefficiency Price of anarchy Transport network design problem Reliability-based user equilibrium 

Notes

Acknowledgments

This work was jointly supported by a grant [No. 201711159034] from the University Research Committee of the University of Hong Kong, a grant from the National Natural Science Foundation of China [No. 71771194], and a grant from the Guangzhou Science Technology and Innovation Commission [No. 201707010292]. The authors are grateful to the Editor-in-Chief and two reviewers for their constructive comments.

References

  1. Abdulaal M, LeBlanc LJ (1979) Continuous equilibrium network design models. Transp Res B 13(1):19–32CrossRefGoogle Scholar
  2. Ben-Ayed O, Boyce DE, Blair CE III (1988) A general bilevel linear programming formulation of the network design problem. Transp Res B 22(4):311–318CrossRefGoogle Scholar
  3. Brownstone D, Small KA (2003) Valuing time and reliability: assessing the evidence from road pricing demonstrations. Transp Res A 39(4):279–293Google Scholar
  4. Chau CK, Sim KM (2003) The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. Oper Res Lett 31(5):327–334CrossRefGoogle Scholar
  5. Chen A, Kim J, Zhou Z, Chootinan P (2007) Alpha reliable network design problem. Transp Res Rec 2029:49–57CrossRefGoogle Scholar
  6. Chen A, Zhou Z (2010) The α-reliable mean-excess traffic equilibrium model with stochastic travel times. Transp Res B 44(4):493–513CrossRefGoogle Scholar
  7. Chen A, Zhou Z, Chootinan P, Ryu S, Yang C, Wong SC (2011) Transport network design problem under uncertainty: a review and new developments. Transp Rev 31(6):743–768CrossRefGoogle Scholar
  8. Chiou S (2005) Bilevel programming for the continuous transport network design problem. Transp Res B 39(4):361–383CrossRefGoogle Scholar
  9. Chootinan P, Wong SC, Chen A (2005) A reliability-based network design problem. J Adv Transp 39(3):247–270CrossRefGoogle Scholar
  10. Chow JYJ, Regan AC (2011) Network-based real option models. Transp Res B 45(4):682–695CrossRefGoogle Scholar
  11. Concas S, Kolpakov A (2009) Synthesis of research on value of time and value of reliability. http://www.nctr.usf.edu/pdf/77806.pdf
  12. Correa J, Schulz A, Stier-Moses N (2004) Selfish routing in capacitated networks. Math Oper Res 29(4):961–976CrossRefGoogle Scholar
  13. Dantzig GB, Maier SF, Harvey RP, Lansdowne ZF, Robinson DW (1979) Formulating and solving the network design problem by decomposition. Transp Res B 13(1):5–17CrossRefGoogle Scholar
  14. Farahani RZ, Miandoabchi E, Szeto WY, Rashidi H (2013) A review of urban transportation network design problems. Eur J Oper Res 229(2):281–302CrossRefGoogle Scholar
  15. Friesz TL, Anandalingam G, Mehta NJ, Nam K, Shah SJ, Tobin RL (1993) The multiobjective equilibrium network design problem revisited: a simulated annealing approach. Eur J Oper Res 65(1):44–57CrossRefGoogle Scholar
  16. Guo XL, Yang H, Liu TL (2010) Bounding the inefficiency of logit-based stochastic user equilibrium. Eur J Oper Res 201(2):463–469CrossRefGoogle Scholar
  17. Han D, Lo HK, Yang H (2008) On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands. Comput Math Appl 56(10):2737–2743CrossRefGoogle Scholar
  18. Han D, Yang H (2008) The multi-class, multi-criterion traffic equilibrium and the efficiency of congestion pricing. Transp Res E 44(5):753–773CrossRefGoogle Scholar
  19. Huang HJ, Liu TL, Guo XL, Yang H (2011) Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS. Netw Spat Econ 11(2):255–269CrossRefGoogle Scholar
  20. Ji XF, Ban XG, Li MT, Zhang J, Ran B (2017) Non-expected route choice model under risk on stochastic traffic networks. Netw Spat Econ 17(3):777–807CrossRefGoogle Scholar
  21. Khani A, Boyles SD (2015) An exact algorithm for the mean-standard deviation shortest path problem. Transp Res B 81:252–266CrossRefGoogle Scholar
  22. Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS): Trier, Germany, Lecture Notes in Computer Science, vol 1563. Springer, Berlin, pp 404–413Google Scholar
  23. LeBlanc LJ, Boyce DE (1986) A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows. Transp Res B 20(3):259–265CrossRefGoogle Scholar
  24. Liu ZY, Yi W, Wang SA, Chen J (2017) On the uniqueness of user equilibrium flow with speed limit. Netw Spat Econ 17(3):763–775CrossRefGoogle Scholar
  25. Lo HK, Luo XW, Siu BWY (2006) Degradable transport network: travel time budget of travelers with heterogeneous risk aversion. Transp Res B 40(9):792–806CrossRefGoogle Scholar
  26. Lo HK, Szeto WY (2009) Time-dependent transport network design under cost-recovery. Transp Res B 43(1):142–158CrossRefGoogle Scholar
  27. Meng Q, Yang H (2002) Benefit distribution and equity in road network design. Transp Res B 36(1):19–35CrossRefGoogle Scholar
  28. Ng MW, Waller ST (2009) Reliable system-optimal network design: convex mean-variance model with implicit chance constraints. Transp Res Rec 2090:68–74CrossRefGoogle Scholar
  29. Roughgarden T (2005) Selfish routing and price of anarchy. MIT Press, CambridgeGoogle Scholar
  30. Roughgarden T, Tardos E (2002) How bad is selfish routing? J ACM 49(2):236–259CrossRefGoogle Scholar
  31. Shao H, Lam WHK, Tam ML (2006) A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand. Netw Spat Econ 6(3):173–204CrossRefGoogle Scholar
  32. Small KA, Yan J (2001) The value of “value pricing” of roads: second-best pricing and product differentiation. J Urban Econ 49:310–336CrossRefGoogle Scholar
  33. Sumalee A, Luathep P, Lam WHK, Connors RD (2009) Transport network capacity evaluation and design under demand uncertainty. Transp Res Rec 2090:17–28CrossRefGoogle Scholar
  34. Szeto WY, Jaber XQ, O’Mahony M (2010) Time-dependent discrete network design frameworks considering land use. Computer-Aided Civil and Infrastructure Engineering 25(6):411–426CrossRefGoogle Scholar
  35. Szeto WY, Lo HK (2005) Strategies for road network design over time: robustness under uncertainty. Transportmetrica 1(1):47–63CrossRefGoogle Scholar
  36. Szeto WY, Lo HK (2008) Time-dependent transport network improvement and tolling strategies. Transp Res A 42(2):376–391Google Scholar
  37. Szeto WY, Wang B (2015) Price of anarchy for reliability-based traffic assignment and network design. Transportmetrica A: Transport Science 11(7):603–635CrossRefGoogle Scholar
  38. Szeto WY, Wang B (2016) Reliable network design under supply uncertainty with probabilistic guarantees. Transportmetrica A: Transport Science 12(6):504–532CrossRefGoogle Scholar
  39. Szeto WY, Wang Y, Wong SC (2014) The chemical reaction optimization approach to solving the environmentally sustainable network design problem. Computer-Aided Civil and Infrastructure Engineering 29(2):140–158CrossRefGoogle Scholar
  40. Tilahun N, Levinson DM (2009) Value of time comparisons in the presence of unexpected delay. In: Saleh W, Sammer G (eds) Travel Demand Management and Road User Pricing: Success, Failure and Feasibility. Ashgate Publishers, Farnham, pp 173–184Google Scholar
  41. Wang B, Szeto WY (2018) Reliability-based user equilibrium in a transport network under the effects of speed limits and supply uncertainty. Appl Math Model 56:186–201CrossRefGoogle Scholar
  42. Wang CL, Doan XV, Chen B (2014) Price of anarchy for non-atomic congestion games with stochastic demands. Transp Res B 70:90–111CrossRefGoogle Scholar
  43. Wardrop JG (1952) Some theoretical aspects of road traffic research. ICE Proceedings: Engineering Divisions 1(3):325–362Google Scholar
  44. Wu X (2015) Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach. Transp Res B 80(9):275–290CrossRefGoogle Scholar
  45. Wu X, Nie Y (2011) Modeling heterogeneous risk-taking behavior in route choice: a stochastic dominance approach. Transp Res A 45(9):896–915Google Scholar
  46. Xiao F, Yang H, Han D (2007) Competition and efficiency of private toll roads. Transp Res B 41(3):292–308CrossRefGoogle Scholar
  47. Yang H (1997) Sensitivity analysis for the elastic-demand network equilibrium problem with applications. Transp Res B 31(1):55–70CrossRefGoogle Scholar
  48. Yang H, Bell MGH (1998) Models and algorithms for road network design: a review and some new developments. Transp Rev 18(3):257–278CrossRefGoogle Scholar
  49. Yang H, Meng Q (2002) A note on “highway pricing and capacity choice in a road network under a build-operate-transfer scheme”. Transp Res A 36(7):659–663Google Scholar
  50. Yin YF, Madanat SM, Lu XY (2009) Robust improvement schemes for road networks under demand uncertainty. Eur J Oper Res 198(2):470–479CrossRefGoogle Scholar
  51. Zhao XM, Wan CH, Bi J (2018) Day-to-day assignment models and traffic dynamics under information provision. Netw Spat Econ.  https://doi.org/10.1007/s11067-018-9386-1 CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Guangzhou Municipal Engineering Design & Research Institute Co., LtdGuangzhouPeople’s Republic of China
  2. 2.Department of Civil EngineeringThe University of Hong KongHong KongPeople’s Republic of China
  3. 3.The University of Hong Kong Shenzhen Institute of Research and InnovationShenzhenPeople’s Republic of China

Personalised recommendations