Network equilibrium models and algorithms
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 …
network equilibrium model (NEM). In the sequel, the terminology used will be that …
[图书][B] Finite-dimensional variational inequalities and complementarity problems
F Facchinei, JS Pang - 2003 - Springer
Complementary to Chapter 11, the present chapter is devoted to the study of solution
methods for VIs that are of the monotone type and also for NCPs of the P 0 type. We already …
methods for VIs that are of the monotone type and also for NCPs of the P 0 type. We already …
Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications
Over the past decade, the field of finite-dimensional variational inequality and
complementarity problems has seen a rapid development in its theory of existence …
complementarity problems has seen a rapid development in its theory of existence …
Simplicial decomposition with disaggregated representation for the traffic assignment problem
T Larsson, M Patriksson - Transportation Science, 1992 - pubsonline.informs.org
The class of simplicial decomposition (SD) schemes has shown to provide efficient tools for
nonlinear network flows. When applied to the traffic assignment problem, shortest route …
nonlinear network flows. When applied to the traffic assignment problem, shortest route …
Nonlinear cost network models in transportation analysis
M Florian - Netflow at Pisa, 1986 - Springer
The analysis of transportation phenomena by quantitative approaches naturally gives rise to
network models that represent the spatial characteristics of the transport infrastructure. This …
network models that represent the spatial characteristics of the transport infrastructure. This …
A combined trip generation, trip distribution, modal split, and trip assignment model
KN Ali Safwat, TL Magnanti - Transportation Science, 1988 - pubsonline.informs.org
Modeling of transportation systems must invariably balance behavioral richness and
computational tractability. In this paper, we develop a transportation equilibrium model and …
computational tractability. In this paper, we develop a transportation equilibrium model and …
Computational experience in solving equilibrium models by a sequence of linear complementarity problems
L Mathiesen - Operations research, 1985 - pubsonline.informs.org
This paper presents a modeling format and a solution algorithm for partial and general
economic equilibrium problems. It reports on computational experience from a series of …
economic equilibrium problems. It reports on computational experience from a series of …
Communication and transportation network reliability using routing models
A general framework is presented for calculating a reliability measure for several types of
flow networks. This framework allows reliability analysis for complicated systems such as …
flow networks. This framework allows reliability analysis for complicated systems such as …
A decomposition scheme for parallelization of system optimal dynamic traffic assignment on urban networks with multiple origins and destinations
M Mehrabipour, L Hajibabai… - Computer‐Aided Civil …, 2019 - Wiley Online Library
This paper presents a decomposition scheme to find near‐optimal solutions to a cell
transmission model‐based system optimal dynamic traffic assignment problem with multiple …
transmission model‐based system optimal dynamic traffic assignment problem with multiple …
[PDF][PDF] Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming algorithms
JH Hammond - 1984 - dspace.mit.edu
The variational inequality problem is a general problem formulation that encompasses a
wide range of problems, including optimization problems, complementarity problems, fixed …
wide range of problems, including optimization problems, complementarity problems, fixed …