A framework for and empirical study of algorithms for traffic assignment
From MaRDI portal
(Redirected from Publication:337346)
Recommendations
- Traffic assignment: equilibrium models
- A framework for user equilibrium dynamic traffic assignment
- Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network
- scientific article; zbMATH DE number 1867317
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1239298 (Why is no real title available?)
- scientific article; zbMATH DE number 1086918 (Why is no real title available?)
- A conjugate gradient projection algorithm for the traffic assignment problem
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
- An exit-flow model used in dynamic traffic assignment
- Computational study of state-of-the-art path-based traffic assignment algorithms
- Finiteness in restricted simplicial decomposition
- Network economics. A variational inequality approach.
- Numerical computing with IEEE floating point arithmetic. Incl. one theorem, one rule of thumb, and one hundred and one exercises
- Origin-Based Algorithm for the Traffic Assignment Problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
Cited in
(22)- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
- Origin-Based Algorithm for the Traffic Assignment Problem
- Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network
- Column generation for the equilibrium route-flow traffic assignment problem
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
- A Combined Algorithm for Solving and Calibrating the Stochastic Traffic Assignment Model
- Real-time traffic assignment using engineered customizable contraction hierarchies
- Integrating link-based discrete credit charging scheme into discrete network design problem
- Issues in the implementation of the DSD algorithm for the traffic assignment problem
- Improving the performance of a traffic system by fair rerouting of travelers
- scientific article; zbMATH DE number 5733352 (Why is no real title available?)
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- Refugee migration networks and regulations: a multiclass, multipath variational inequality framework
- Algorithms and Computation
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- An exact second order cone programming approach for traffic assignment problems
- Modifying link capacity to avoid Braess paradox considering elastic demand
- scientific article; zbMATH DE number 5524119 (Why is no real title available?)
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- Non-additive shortest path in the context of traffic assignment
- Paradigms to deploy a behavior-consistent approach for information-based real-time traffic routing
This page was built for publication: A framework for and empirical study of algorithms for traffic assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337346)
