Origin-Based Algorithm for the Traffic Assignment Problem
From MaRDI portal
Publication:4408707
DOI10.1287/trsc.36.4.398.549zbMath1134.90469OpenAlexW2118258531MaRDI QIDQ4408707
Publication date: 29 June 2003
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.36.4.398.549
Related Items (36)
A branch and bound algorithm for bi-level discrete network design problem ⋮ Path flow estimator in an entropy model using a nonlinear L-shaped algorithm ⋮ Breakdown minimization principle versus Wardrop's equilibria for dynamic traffic assignment and control in traffic and transportation networks: a critical mini-review ⋮ A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand ⋮ User equilibrium with recourse ⋮ Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem ⋮ Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models ⋮ A framework for and empirical study of algorithms for traffic assignment ⋮ Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ Modifying link capacity to avoid Braess paradox considering elastic demand ⋮ Braess' paradox: A cooperative game‐theoretic point of view ⋮ Telecommunications network design: Technology impacts and future directions ⋮ 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 ⋮ A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost ⋮ An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem ⋮ Estimating the capacity of urban transportation networks with an improved sensitivity based method ⋮ A convergent and fast path equilibration algorithm for the traffic assignment problem ⋮ Robust optimization in the presence of uncertainty: a generic approach ⋮ An improved origin-based algorithm for solving the combined distribution and assignment problem ⋮ Traffic equilibrium and charging facility locations for electric vehicles ⋮ An \(N\)-path user equilibrium for transportation networks ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Fragile networks: identifying vulnerabilities and synergies in an uncertain age ⋮ Finding flow equilibrium with projective methods with decomposition and route generation ⋮ Refugee migration networks and regulations: a multiclass, multipath variational inequality framework ⋮ 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 ⋮ A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models ⋮ A convergent and efficient decomposition method for the traffic assignment problem ⋮ A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem ⋮ Numerical stability of path-based algorithms for traffic assignment ⋮ ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems ⋮ Algorithms for distributing traffic flows ⋮ Primal convergence from dual subgradient methods for convex optimization ⋮ On the convergence of inexact block coordinate descent methods for constrained optimization
This page was built for publication: Origin-Based Algorithm for the Traffic Assignment Problem
