Abstract
In this paper, the problem of interferences between motors and non-motors in urban road mixed traffic network is considered and the corresponding link impedance function is presented based on travel demand. On the base of this, the main factors that influence travelers’ traffic choices are all considered and a combined model including flow-split and assignment problem is proposed. Then a bi-level model with its algorithm for system optimization of urban road mixed traffic network is proposed. Finally the application of the model and its algorithm is illustrated with a numerical example.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Dafermos S C. Relaxation algorithm for the general asymmetric traffic equilibrium problem. Transport Sci, 1982, 16: 231–240
Smith M J. An algorithm for solving asymmetric equilibrium problem with a continuous cost-flow function. Transport Res, 1983, 18B: 432–448
Sheffi Y. Urban Transportation networks: equilibrium analysis with mathematical programming methods. New Jersey: Prentice-Hall, 1985
Friesz T L. Transportation network equilibrium, design and aggregation: key developments and research opportunities. Transport Res, 1985, 19A: 413–427
Huang H J, Lam W H K. Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues. Transport Res, 2002, 36B: 253–273
Ben-Akiva M, Lerman S R. Discrete Choice Analysis: Theory and Application to Travel Demand. Cambridge: The MIT Press, 1985
Mcfaden. A method of simulated moments for estimation of discrete response models without numerical integration. Econometrica, 1989, 57: 995–1026
Yang H, Huang H J. The multi-class, multi-criteria traffic network equilibrium and system optimum problem. Transport Res, 2004, 38B: 1–15
Abdulaal M, LeBlanc L J. Continuous equilibrium network design models. Transport Res, 1979, 13B: 19–32
Gao Z Y, Song Y F. A reserve capacity model of optimal signal control with user-equilibrium route choice. Transport Res, 2002, 36B: 313–323
Gao Z Y, Sun H J, Wu J J. Solution algorithm for the bi-level discrete network design problem. Transport Res, 2005, 39B: 479–495
Yang H, Sasaki T, Iida Y, et al. Estimation of origin-destination matrices from link traffic counts on congested networks. Transport Res, 1992, 26B: 417–434
Zhang X N, Yang H. The optimal cordon-based network congestion pricing problem. Transport Res, 2004, 38B: 517–537
Si B F, Sun Z Z, Zhao X M. Mixed traffic network flow-split model based on stochastic user equilibrium (in Chinese). China J Highway Transport, 2006, 19(1): 93–98
Fisk C S. Game theory and transportation systems modeling. Transport Res, 1984, 18B: 301–313
Suwansirikul C, Friesz T L, Tobin R L. Equilibrium decomposed optimization: a heuristic for the continuous equilibrium network design problem. Transport Sci, 1987, 21(4): 254–263
Tobin R L, Friesz T L. Sensitivity analysis for equilibrium network flow. Transport Sci, 1988, 22(4): 242–250
Yang H, Yagar S. Traffic assignment and traffic control in general freeway-arterial corridor systems. Transport Res, 1994, 28B: 463–486
Wong S C, Yang H. Reserve capacity of a signal-controlled road network. Transport Res, 1997, 31B: 396–402
Chiou S W. Optimization of area traffic control for equilibrium network flows. Transport Sci, 1999, 33: 279–289
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (Grant No. 70631001) and the National Basic Research Program of China (“973”) (Grant No. 2006CB705500)
Rights and permissions
About this article
Cite this article
Si, B., Long, J. & Gao, Z. Optimization model and algorithm for mixed traffic of urban road network with flow interference. Sci. China Ser. E-Technol. Sci. 51, 2223–2232 (2008). https://doi.org/10.1007/s11431-008-0248-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11431-008-0248-9