A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand

DOI10.1016/j.cor.2018.11.004zbMath1458.90199OpenAlexW2901572114MaRDI QIDQ1634068

Alessandro Galligari, Marco Sciandrone

Publication date: 17 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.11.004

zbMATH Keywords

column generationdecomposition methodsnetwork equilibriumcyclic block-coordinate methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items

Column generation for the equilibrium route-flow traffic assignment problem, Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network, An alternating direction method of multipliers for solving user equilibrium problem

Cites Work

• Unnamed Item
• A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
• A framework for and empirical study of algorithms for traffic assignment
• On the convergence of descent methods for monotone variational inequalities
• A convergent and efficient decomposition method for the traffic assignment problem
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Origin-Based Algorithm for the Traffic Assignment Problem
• Traffic assignment problem for a general network