A convergent and efficient decomposition method for the traffic assignment problem
From MaRDI portal
Publication:2515069
Recommendations
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- A partial linearization method for the traffic assignment problem
- A simplicial decomposition method for the transit equilibrium assignment problem
Cites work
- A convergent decomposition algorithm for support vector machines
- Algorithms for computing traffic equilibria
- Downlink beamforming for DS-CDMA mobile radio with multimedia services
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 956791 (Why is no real title available?)
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- On the convergence of descent methods for monotone variational inequalities
- Origin-Based Algorithm for the Traffic Assignment Problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Traffic assignment problem for a general network
Cited in
(23)- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
- A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem
- Column generation for the equilibrium route-flow traffic assignment problem
- A unified convergence framework for nonmonotone inexact decomposition methods
- On the convergence of inexact block coordinate descent methods for constrained optimization
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
- Issues in the implementation of the DSD algorithm for the traffic assignment problem
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
- Numerical stability of path-based algorithms for traffic assignment
- Decomposition techniques for the minimum toll revenue problem
- scientific article; zbMATH DE number 5733352 (Why is no real title available?)
- scientific article; zbMATH DE number 5524119 (Why is no real title available?)
- Decomposition of Path Choice Entropy in General Transport Networks
- A dual scheme for traffic assignment problems
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision
- Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- 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 exact second order cone programming approach for traffic assignment problems
- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
This page was built for publication: A convergent and efficient decomposition method for the traffic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515069)
