Chapter 6 Network equilibrium models and algorithms
作者： Michael Florian , Donald Hearn
DOI: 10.1016/S0927-0507(05)80110-0
关键词: Context (language use) 、 Terminology 、 Nonlinear system 、 Order (exchange) 、 Mathematical optimization 、 Uniqueness 、 Optimization problem 、 Variational inequality 、 Algorithm 、 Mathematics 、 Mathematical structure
摘要: Publisher Summary This chapter introduces the formulation, analysis and solution of the network equilibrium model (NEM). In the sequel, the terminology used will be that …
sci-hub.se 参考文章(207)
Vantagnetta, Pdc Dow, CAPACITY-RESTRAINED ROAD ASSIGNMENT Traffic engineering and control. ,vol. 20, ,(1979)
M Backmann, None, Lectu re Notes in Economics and Mathematical Systems ,(1975)
Ron. S. Dembo, A primal truncated newton algorithm with application to large-scale nonlinear network optimization Mathematical Programming Studies. ,vol. 31, pp. 43- 71 ,(1987) , 10.1007/BFB0121178
Pablo Serra, AndrEeAs Weintraub, Convergence of Decomposition Algorithms for the Traffic Assignment Problem North-Holland Mathematics Studies. ,vol. 59, pp. 313- 318 ,(1981) , 10.1016/S0304-0208(08)73473-X
L G Willumsen, M Hall, SATURN - A SIMULATION-ASSIGNMENT MODEL FOR THE EVALUATION OF TRAFFIC MANAGEMENT SCHEMES Traffic engineering and control. ,vol. 21, ,(1980)
Thomas L Magnanti, Bruce L Golden, TRANSPORTATION PLANNING: NETWORK MODELS AND THEIR IMPLEMENTATION ,(1978)
Ron S. Dembo, John G. Klincewicz, A scaled reduced gradient algorithm for network flow problems with convex separable costs Mathematical Programming Studies. pp. 125- 147 ,(1981) , 10.1007/BFB0120941
D. W. Hearn, S. Lawphongpanich, J.A. Ventura, Restricted simplicial decomposition: Computation and extensions Mathematical Programming Studies. ,vol. 31, pp. 99- 118 ,(1987) , 10.1007/BFB0121181
Michael Florian, Nonlinear cost network models in transportation analysis Mathematical Programming Studies. pp. 167- 196 ,(1986) , 10.1007/BFB0121092
M J Beckmann, ON THE THEORY OF TRAFFIC FLOW IN NETWORKS Traffic quarterly. ,vol. 21, ,(1967)