Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
From MaRDI portal
Publication:4004822
DOI10.1287/trsc.26.1.4zbMath0764.90033OpenAlexW2168405789MaRDI QIDQ4004822
Michael Patriksson, Torbjörn Larsson
Publication date: 27 September 1992
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3c6ae4fdbb38b79716343117d2997d8b46e54ac8
traffic assignmentnetwork topologysimplicial decompositiontransportation networknonlinear network flowsorigin-destination flows
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A dual approach for solving the combined distribution and assignment problem with link capacity constraints, Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem, Computational study of state-of-the-art path-based traffic assignment algorithms, Improving the convergence of simulation-based dynamic traffic assignment methodologies, A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand, Dynamic penalty function method for the side constrained traffic assignment problem, Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem, A model for evaluation of transport policies in multimodal networks with road and parking capacity constraints, A framework for and empirical study of algorithms for traffic assignment, A survey of some mathematical programming models in transportation, A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network, Bio-inspired paradigms in network engineering games, Column generation for the equilibrium route-flow traffic assignment problem, Boundedly rational user equilibrium with restricted unused routes, Bilevel programming in traffic planning: Models, methods and challenge, A conjugate gradient projection algorithm for the traffic assignment problem, Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size, Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs, Braess' paradox: A cooperative game‐theoretic point of view, Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network, An alternating direction method of multipliers for solving user equilibrium problem, A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem, An oracle-based framework for robust combinatorial optimization, New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks, Issues in the implementation of the DSD algorithm for the traffic assignment problem, Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints, A survey on the continuous nonlinear resource allocation problem, A convergent and fast path equilibration algorithm for the traffic assignment problem, A dual scheme for traffic assignment problems, An improved origin-based algorithm for solving the combined distribution and assignment problem, Solving the combined modal split and traffic assignment problem with two types of transit impedance function, Inverse Nonlinear Multicommodity Flow Optimization by Column Generation, Equilibrium network design of shared-vehicle systems, A mean-variance model for the minimum cost flow problem with stochastic arc costs, A comparison of feasible direction methods for the stochastic transportation problem, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, A convergent and efficient decomposition method for the traffic assignment problem, A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem, Improving truncated Newton method for the logit-based stochastic user equilibrium problem, Postoptimizing equilibrium flows on large scale networks, Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems, Sensitivity Analysis of Welfare, Equity, and Acceptability Level of Transport Policies, A unified description of iterative algorithms for traffic equilibria
