Skip to main content
SpringerLink
Log in

Bounding the inefficiency of the C-logit stochastic user equilibrium assignment

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Compared with standard logit-based stochastic user equilibrium assignment model, the C-logit model describes route choice behavior in a more realistic way by considering the overlapping effect between routes. This paper investigates the inefficiency upper bounds of this model against the deterministic system optimum and the C-logit stochastic system optimum in terms of the total network travel time. It is found that the commonality factor of overlapping routes significantly affects the inefficiency bound, besides link congestion degree, total demand and the number of feasible routes. If the commonality factor is not considered, the efficiency loss resulting from selfishly stochastic travel behavior will be to large extent underestimated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sheffi Y, Urban Transportation Networks, Prentice-Hall, Englewood Cliffs, 1985.

    Google Scholar 

  2. Daganzo C F and Sheffi Y, On stochastic models of traffic assignment, Transport. Sci., 1977, 11: 253–274.

    Article  Google Scholar 

  3. Huang H J, Wang S Y, and Bell M G H, A bi-level formulation and quasi-Newton algorithm for stochastic equilibrium network design problem with elastic demand, Journal of Systems Science and Complexity, 2001, 14(1): 34–50.

    MathSciNet  Google Scholar 

  4. Bekhor S and Prashker J N, Stochastic user equilibrium formulation for generalized nested logit model, Transport. Res. Rec., 2001, 1752: 84–90.

    Article  Google Scholar 

  5. Chen P, Kasikitwiwat Z, and Ji Z, Solving the overlapping problem in route choice with paired combinatorial logit model, Transport. Res. Rec., 2003, 1857: 65–73.

    Article  Google Scholar 

  6. Papola A, Some developments on the cross-nested logit model, Transport. Res. B-Meth., 2004, 38B: 833–851.

    Article  Google Scholar 

  7. Pravinvongvuth S and Chen A, Adaptation of the paired combinatorial logit model to the route choice problem, Transportmetrica, 2005, 1: 223–240.

    Article  Google Scholar 

  8. Hoogendoorn S and Bovy P, Modeling overlap in multimodal route choice by including trip part-specific path size factors. Transport. Res. Rec., 2007, 2003: 78–83.

  9. Ren G, Huang Z F, Lu L L, et al., Method of generating strategic guidance information for driving evacuation flows to approach safety-based system optimal dynamic flows: Case study of a large stadium, Journal of Systems Science and Complexity, 2015, 28(3): 606–622.

    Article  MathSciNet  MATH  Google Scholar 

  10. Cascetta E, Nuzzolo A, Russo F, et al., A modified logit route choice model overcoming path overlapping problems: Specification and some calibration results for interurban networks, Proceedings of the 13th International Symposium on Transportation and Traffic Theory, Lyon, 1996, 697–711.

    Google Scholar 

  11. Zhou Z, Chen A, and Bekhor S, C-logit stochastic user equilibrium model: Formulations and solution algorithm, Transportmetrica, 2012, 8: 17–41.

    Article  Google Scholar 

  12. Koutsoupias E and Papadimitriou C H, Worst-case equilibria, Lect. Notes. Comput. Sci., 1999, 1563: 404–413.

    Article  MathSciNet  MATH  Google Scholar 

  13. Papadimitriou C H, Algorithms, games, and the internet, Proceedings of the 33th Annual ACM Symposium on Theory of Computing, 2001, 749–753.

    Google Scholar 

  14. Roughgarden T and Tardos E, How bad is selfish routing? J. ACM., 2002, 49: 236–259.

  15. Roughgarden T, The price of anarchy is independent of the network topology, Proceedings of the 34th ACM Symposium on Theory of Computing, 2002, 428–437.

    Google Scholar 

  16. Chau C K and Sim K M, The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands, Oper. Res. Lett., 2003, 31: 327–334.

    Article  MathSciNet  MATH  Google Scholar 

  17. Correa J R, Schulz A S, and Stier-Moses N S, Selfish routing in capacitated networks, Math. Oper. Res., 2004, 29: 961–976.

    Article  MathSciNet  MATH  Google Scholar 

  18. Roughgarden T and Tardos E, Bounding the inefficiency of equilibria in non-atomic congestion games, Game. Econ. Behav., 2004, 47: 389–403.

    Article  MathSciNet  MATH  Google Scholar 

  19. Yang H, Han D, and Lo H K, Efficiency bounding of atomic splittable selfish routing with polynomial cost functions, Netw. Spat. Econ., 2008, 8: 443–451.

    Article  MathSciNet  MATH  Google Scholar 

  20. Han D and Yang H, The multi-class, multi-criterion traffic equilibrium and the efficiency of congestion pricing, Transport. Res. E-Log., 2008, 44E: 753–773.

    Article  Google Scholar 

  21. Feng Z Z, Gao Z Y, and Sun H J, Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands, Transport. Res. E-Log., 2014, 63E: 31–43.

    Article  Google Scholar 

  22. Liu T L, Chen J, and Huang H J, Existence and efficiency of oligopoly equilibrium under toll and capacity competition, Transport. Res. E-Log., 2011, 47E: 908–919.

    Article  Google Scholar 

  23. Guo X, Yang H, and Liu T L, Bounding the inefficiency of logit-based stochastic user equilibrium, Eur. J. Oper. Res., 2010, 201: 463–469.

    Article  MathSciNet  MATH  Google Scholar 

  24. Maher M, Stewart K, and Rosa A, Stochastic social optimum traffic assignment, Transport. Res. B-Meth., 2005, 39B: 753–767.

    Article  Google Scholar 

  25. Yang H, System optimum, stochastic user equilibrium, and optimal link tolls, Transport. Sci., 1999, 33: 354–360.

    Article  MATH  Google Scholar 

  26. Huang H J, Liu T L, Guo X L, et al., Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS, Netw. Spat. Econ., 2011, 11: 255–269.

    Article  MathSciNet  MATH  Google Scholar 

  27. Yu X J and Fang C H, Efficiency loss of mixed equilibrium associated with altruistic users and logit-based stochastic users in transportation network, Promet.-Zagreb., 2014, 26: 45–51.

    Google Scholar 

  28. Correa J R, Schulz A S, and Stier-Moses N S, On the inefficiency of equilibria in congestion games, Lect. Notes. Comput. Sci., 2005, 3509: 167–181.

    Article  MathSciNet  MATH  Google Scholar 

  29. Roughgarden T, Selfish Routing and the Price of Anarchy, MIT, Cambridge, 2005.

    MATH  Google Scholar 

  30. Knight F H, Some fallacies in the interpretation of social costs, Q. J. Econ., 1924, 38: 582–606.

    Article  Google Scholar 

  31. Pigou A C, The Economics of Welfare, MacMillan, London, 1920.

    Google Scholar 

  32. Yang H and Huang H J, Principle of marginal-cost pricing: How does it work in a general network? Transport. Res. A-Pol., 1998, 32A: 45–54.

  33. Yang H and Huang H J, The multi-class, multi-criteria traffic network equilibrium and systems optimum problem, Transport. Res. B-Meth., 2004, 38B: 1–15.

    Google Scholar 

  34. Sumalee A and Xu W, First-best marginal cost toll for a traffic network with stochastic demand, Transport. Res. B-Meth., 2011, 45B: 41–59.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Economics and Management, Beihang University, Beijing, 100191, China

    Gui Yong, Haijun Huang & Tianliang Liu

  2. School of Statistics and Mathematics, Inner Mongolia University of Finance and Economics, Huhhot, 010070, China

    Gui Yong

  3. School of Statistics and Mathematics, Inner Mongolia University of Finance and Economics, Huhhot, 010070, China

    Yan Xu

Authors
  1. Gui Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haijun Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tianliang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tianliang Liu.

Additional information

The research was supported by the National Basic Research Program of China under Grant No. 2012CB725401, the National Natural Science Foundation of China under Grant Nos. 71271001 and 71401083, and the Program for New Century Excellent Talents in University under Grant No. NCET-13-0025.

This paper was recommended for publication by Editor ZHANG Xun.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yong, G., Huang, H., Liu, T. et al. Bounding the inefficiency of the C-logit stochastic user equilibrium assignment. J Syst Sci Complex 29, 1629–1649 (2016). https://doi.org/10.1007/s11424-016-4320-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-016-4320-4

Keywords

Search

Navigation