Origin-Based Algorithm for the Traffic Assignment Problem
From MaRDI portal
Recommendations
- An extended origin-based method for solving capacitated traffic assignment problem
- A path-based solution algorithm for dynamic traffic assignment
- scientific article; zbMATH DE number 1559447
- An algorithm of traffic assignment based on Gröbner bases method
- The Simultaneous Origin-Destination Assignment and Vehicle Routing Problem
- A dual scheme for traffic assignment problems
- A combinatorial user optimal dynamic traffic assignment algorithm
- A framework for and empirical study of algorithms for traffic assignment
- A conjugate gradient projection algorithm for the traffic assignment problem
- scientific article; zbMATH DE number 1488064
Cited in
(49)- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Algorithms for distributing traffic flows
- Computational study of state-of-the-art path-based traffic assignment algorithms
- 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
- Estimating the capacity of urban transportation networks with an improved sensitivity based method
- Robust optimization in the presence of uncertainty: a generic approach
- Non-additive shortest path in the context of traffic assignment
- An \(N\)-path user equilibrium for transportation networks
- Refugee migration networks and regulations: a multiclass, multipath variational inequality framework
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- Finding flow equilibrium with projective methods with decomposition and route generation
- A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem
- Primal convergence from dual subgradient methods for convex optimization
- On the convergence of inexact block coordinate descent methods for constrained optimization
- Path flow estimator in an entropy model using a nonlinear L-shaped algorithm
- An improved origin-based algorithm for solving the combined distribution and assignment problem
- A convergent and efficient decomposition method for the traffic assignment problem
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models
- A branch and bound algorithm for bi-level discrete network design problem
- Modifying link capacity to avoid Braess paradox considering elastic demand
- Numerical stability of path-based algorithms for traffic assignment
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- An algorithm of traffic assignment based on Gröbner bases method
- A framework for and empirical study of algorithms for traffic assignment
- An extended origin-based method for solving capacitated traffic assignment problem
- A partial linearization method for the traffic assignment problem
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- scientific article; zbMATH DE number 1867317 (Why is no real title available?)
- Fragile networks: identifying vulnerabilities and synergies in an uncertain age
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- Direct computing methods for turn flows in traffic assignment
- A conjugate gradient projection algorithm for the traffic assignment problem
- Braess' paradox: A cooperative game‐theoretic point of view
- Telecommunications network design: Technology impacts and future directions
- A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables
- 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
- A variational inequality formulation for stochastic user equilibrium with a bounded choice set
- A distributed computing method integrating improved gradient projection for solving stochastic traffic equilibrium problem
- Traffic equilibrium and charging facility locations for electric vehicles
- On the application of saddle-point methods for combined equilibrium transportation models
- Maxflow-based integrated network design and scheduling problems with downgraded capacities
- NLF: A Resistor-Network Framework and Linear-Time Solver for Convex Network-Flow Equilibria
- User equilibrium with recourse
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
- A comparison of feasible direction methods for the stochastic transportation problem
This page was built for publication: Origin-Based Algorithm for the Traffic Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408707)