Bush-based sensitivity analysis for approximating subnetwork diversion

Transportation Research Part B: Methodological

Volumn 46, Issue 1, 2012, Pages 139-155

  Boyles, Stephen D ^a  

^a The University of Texas at Austin   (United States)

Author keywords

Equilibrium bushes; Equilibrium sensitivity analysis; Static traffic assignment; Subnetwork analysis

Indexed keywords

COMBINATORIAL OPTIMIZATION; COST FUNCTIONS; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; METROPOLITAN AREA NETWORKS; TRAFFIC CONTROL; TRAVEL TIME;

EQUILIBRIUM BUSHES; EQUILIBRIUM SENSITIVITY ANALYSIS; NETWORK TRANSFORMATION; OPTIMIZATION PROGRAMS; PRIMARY CONTRIBUTION; STATIC TRAFFIC ASSIGNMENTS; SUBNETWORK ANALYSIS; TRAFFIC ASSIGNMENT PROBLEM;

SENSITIVITY ANALYSIS;

ACCURACY ASSESSMENT; METROPOLITAN AREA; NETWORK ANALYSIS; SENSITIVITY ANALYSIS; TRAFFIC MANAGEMENT; TRAVEL TIME;

AUSTIN; TEXAS; UNITED STATES;

EID: 80755184704     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2011.09.004     Document Type: Article

References (30)

1. Akers S.B. The use of wye-delta transformations in network simplification. Operations Research 1960, 8(3):311-323.
2. Bar-Gera H. Origin-based algorithm for the traffic assignment problem. Transportation Science 2002, 36(4):398-417.
3. Bar-Gera H. Traffic assignment by paired alternative segments. Transportation Research Part B 2010, 44(8-9):1022-1046.
4. Bar-Gera H., Boyce D. Origin-based algorithms for combined travel forecasting models. Transportation Research Part B 2003, 37(5):405-422.
5. Barton R.R., Hearn D.W. Network Aggregation in Transportation Planning Models. Technical Report. Report DOT-TSC-RSPA-79-18 1979, United States Department of Transportation.
6. Beckmann M.J., McGuire C.B., Winston C.B. Studies in the Economics of Transportation 1956, Yale University Press, Connecticut.
7. Bovy P.H.L., Jansen G.R.M. Network aggregation effects upon equilibrium assignment outcomes: an empirical investigation. Transportation Science 1983, 17(3):240-262.
8. Boyce, D.E., Chon, K.S., Ferris, M.E., Lee, Y.J., Lin, K.-T., Eash, R.W., 1985. Implementation and Evaluation of Combined Models of Urban Travel and Location on a Sketch Planning Network. Technical Report.
9. Boyce D., Ralevic-Dekic B., Bar-Gera H. Convergence of traffic assignments: how much is enough?. Journal of Transportation Engineering 2004, 130(1):49-55.
10. Chan Y. A method to simplify network representation in transportation planning. Transportation Research 1976, 10(3):179-191.
11. Cho H.-J., Smith T.E., Friesz T.L. A reduction method for local sensitivity analyses of network equilibrium arc flow. Transportation Research Part B 2000, 34(1):31-51.
12. Cooper L., LeBlanc L.J. Stochastic transportation problems and other network related convex problems. Naval Research Logistics Quarterly 1977, 24(2):327-337.
13. Dial R.B. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Research Part B 2006, 40(10):917-936.
14. Dowling R.G., May A.D. Comparison of small-area OD estimation techniques. Transportation Research Record 1985, 1045:9-15.
15. Eash R.W., Chon K.S., Lee Y.J., Boyce D.E. Equilibrium traffic assignment on an aggregated highway network for sketch planning. Transportation Research Record 1983, 944:30-37.
16. Feo T.A., Provan J.S. Delta-wye transformations and the efficient reduction of two-terminal planar graphs. Operations Research 1993, 41(3):572-582.
17. Gartner N.H. Optimal traffic assignment with elastic demands: a review. Part II: Algorithmic approaches. Transportation Science 1980, 14(2):192-208.
18. Gentile, G., 2009. Linear User Cost Equilibrium: A New Algorithm for Traffic Assignment. Working paper.
19. Haghani A.E., Daskin M.S. Network design application of an extraction algorithm for network aggregation. Transportation Research Record 1983, 944:37-46.
20. Hearn D.W. Practical and theoretical aspects of aggregation problems in transportation planning models. Transportation Planning Models 1984, 257-288. North Holland, Amsterdam. M. Florian (Ed.).
21. Lu S. Sensitivity of static traffic user equilibria with perturbations in arc cost function and travel demand. Transportation Science 2008, 42(1):105-123.
22. Lu S., Nie Y. Stability of user-equilibrium route flow solutions for the traffic assignment problem. Transportation Research Part B 2010, 44(4):609-617.
23. Saishu K., Moriwaki Y. Optimal assignment of traffic flows. Electrical Engineering in Japan 1972, 92(2):113-120.
24. Sasaki, T., Inouye, H., 1974. Traffic assignment by analogy to electric circuits. In: Proceedings of the 6th International Symposium on Transportation and Traffic Theory, Sydney, pp. 495-518.
25. Sheffi Y. Urban Transportation Networks 1985, Prentice-Hall, Englewood Cliffs, NJ.
26. Sherman J., Morrison W.J. Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. The Annals of Mathematical Statistics 1950, 21(1):124-127.
27. Tobin R.L., Friesz T.L. Sensitivity analysis for equilibrium network flow. Transportation Science 1988, 22(4):242-250.
28. Xie, C., Kockelman, K., Waller, S.T., 2010. A maximum entropy method for subnetwork origin-destination trip matrix estimation. Presented at the 89th Annual Meeting of the Transportation Research Board, Washington, DC.
29. Xie, C., Kockelman, K., Waller, S.T., 2011. A maximum entropy-least squares estimator for elastic origin-destination trip matrix estimation. Submitted for Presentation at the 19th International Symposium on Transportation and Traffic Theory, Berkeley, CA.
30. Yang H., Bell M.G.H. Sensitivity analysis of network traffic equilibria revisited: the corrected approach. Mathematics in Transport 2007, 373-411. Elsevier. B. Heydecker (Ed.).