An efficient algorithm for computing traffic equilibria using TRANSYT model
From MaRDI portal
Recommendations
- An efficient algorithm for optimal design of area traffic control with network flows
- Algorithms for computing traffic equilibria
- An efficient computation algorithm for area traffic control problem with link capacity expansions
- scientific article; zbMATH DE number 5177360
- An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
Cites work
- A hybrid approach for optimal design of signalized road network
- A non-smooth model for signalized road network design problems
- Combined signal setting design and traffic assignment problem.
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- Projection methods for variational inequalities with application to the traffic assignment problem
Cited in
(6)- Multi-class time reliability-based congestion pricing model based on a degradable transportation network
- Algorithms for computing traffic equilibria
- An efficient computation algorithm for area traffic control problem with link capacity expansions
- An efficient algorithm for optimal design of area traffic control with network flows
- A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
This page was built for publication: An efficient algorithm for computing traffic equilibria using TRANSYT model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611588)