A convergent and efficient decomposition method for the traffic assignment problem

DOI10.1007/s10589-014-9668-6zbMath1315.90057OpenAlexW2043830623MaRDI QIDQ2515069

D. Di Lorenzo, Alessandro Galligari, Marco Sciandrone

Publication date: 10 February 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-014-9668-6

zbMATH Keywords

column generationdecomposition methodsnetwork equilibriumcyclic block-coordinate methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (6)

A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand ⋮ Column generation for the equilibrium route-flow traffic assignment problem ⋮ Braess' paradox: A cooperative game‐theoretic point of view ⋮ Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network ⋮ A convergent and fast path equilibration algorithm for the traffic assignment problem ⋮ A unified convergence framework for nonmonotone inexact decomposition methods

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for computing traffic equilibria
• On the convergence of descent methods for monotone variational inequalities
• A convergent decomposition algorithm for support vector machines
• Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Origin-Based Algorithm for the Traffic Assignment Problem
• Downlink beamforming for DS-CDMA mobile radio with multimedia services
• Traffic assignment problem for a general network

This page was built for publication: A convergent and efficient decomposition method for the traffic assignment problem