Abstract

The efficiency of a transportation network is the comprehensive performance index of the network. In order to evaluate the operation situation of the transportation network objectively, the scientific quantitative evaluation method for the network efficiency is very important. In this study, a new quantitative evaluation method for transportation network efficiency is developed, which could evaluate the transportation network performance comprehensively and reasonably. The method is defined in the context of network equilibrium, which could reflect the influences of travel behavior, travel cost, travel demands and link flows, all in equilibrium state, on network efficiency. The computation results compared with a previously proposed one by numerical example, which denote that the new method can quantitatively reflect the influence on the transportation network efficiency induced by traffic flows, user behavior and network structure, which accords with the practical situation.

Keywords:

Efficiency, quantitative evaluation method, traffic equilibrium, transportation network,

References

1. Anna, N. and Q. Qiang, 2007. A network efficiency measure for congested networks. Europhys. Lett., 79: 1-5.
   
2. Anna, N. and Q. Qiang, 2008. A network efficiency measure with application to critical infrastructure networks. J. Glob. Optim., 40(1): 261-275.
   
3. Anthony, C., L. Derhorng and R. Jayakrishnan, 2002. Computational study of state-of-the-art path-based traffic assignment algorithms. Math. Comput. Simulat., 59(6): 509-518.
   CrossRef    
4. Chaug-Ing, H. and S. Hsien-Hung, 2008. Small-world network theory in the study of network connectivity and efficiency of complementary international airline alliances. J. Air Transp. Manag., 14(3): 123-129.
   CrossRef    
5. David, L., 2003. Perspectives on efficiency in transportation. Int. J. Transp. Manage., 1(3): 45-155.
   
6. Dietrich, B., N. Anna and W. Tina, 2005. On a paradox of traffic planning. Transport. Sci., 39(4): 446-450.
   CrossRef    
7. Masao, F., 1984. A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transport. Res. B-Meth., 18(2): 169-177.
   
8. Paolo, C., L. Vito, M. Massimo and R. Andrea, 2003. Efficiency of scale-free networks: Error and attack tolerance. Phys. A, 320(3): 622-642.
   
9. Roughgarden, T., 2002. How bad is selfish routings. J. ACM, 49: 236-259.
   CrossRef    
10. Vito, L. and M. Massimo, 2001. Efficient behavior of small-world networks. Phys. Rev. Lett., 87(19): 198701.
    CrossRef    PMid:11690461    
11. Vito, L. and M. Massimo, 2002. Is the Boston subway a small-world networks. Phys. Rev. Lett., 87: 198701.
    
12. Vito, L. and M. Massimo, 2003. Economic small-world behavior in weighted networks [J]. Eur. Phys. J. B, 32(2): 249-263.
    CrossRef    
13. Vito, L. and M. Massimo, 2004. How the science of complex networks can help developing strategies against terrorism. Chaos Solition. Fract., 20(1): 69-75.
    CrossRef    
14. Xiaolei, G., Y. Hai and L. Tianliang, 2010. Bounding the inefficiency of logit-based stochastic user equilibrium. Eur. J. Oper. Res., 201(2): 463-469.
    CrossRef    
15. Yossi, S., 1984. Urban Transportation Network: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, NJ.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.