A class of bush-based algorithms for the traffic assignment problem
暂无分享,去创建一个
[1] D. Bertsekas,et al. Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.
[2] Robert B. Dial,et al. A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .
[3] Larry J. LeBlanc,et al. AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .
[4] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..
[5] Stella C. Dafermos,et al. Traffic assignment problem for a general network , 1969 .
[6] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .
[7] Hillel Bar-Gera,et al. Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..
[8] R. Jayakrishnan,et al. A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT , 1994 .
[9] Robert Barkley Dial. Probabilistic assignment: a multipath traffic assignment model which obviates path enumeration , 1970 .
[10] M. Fukushima. A modified Frank-Wolfe algorithm for solving the traffic assignment problem , 1984 .
[11] Dimitri P. Bertsekas,et al. Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..
[12] T. Koopmans,et al. Studies in the Economics of Transportation. , 1956 .
[13] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[14] Hillel Bar-Gera,et al. Convergence of Traffic Assignments: How Much Is Enough? 1 , 2004 .
[15] L. Armijo. Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .
[16] J. Wardrop. ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .
[17] Werner C. Rheinboldt,et al. Methods for solving systems of nonlinear equations , 1987 .
[18] Stella Dafermos,et al. An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .
[19] George L. Nemhauser,et al. A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .
[20] J. A. Ventura,et al. Finiteness in restricted simplicial decomposition , 1985 .
[21] Robert B. Dial,et al. Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case , 1999 .
[22] Howard Slavin,et al. An empirical comparison of alternative user equilibrium traffic assignment methods , 2006 .
[23] Gordon F. Newell,et al. Traffic flow on transportation networks , 1980 .
[24] Yosef Sheffi,et al. Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .
[25] Robert B. Dial,et al. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration , 2006 .
[26] Torbjörn Larsson,et al. Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..