Issues in the implementation of the DSD algorithm for the traffic assignment problem

DOI10.1016/j.ejor.2005.02.029zbMath1142.90355OpenAlexW2065852416MaRDI QIDQ2433525

Pablo A. Lotito

Publication date: 27 October 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.029

zbMATH Keywords

quadratic programmingnonlinear programmingnetwork flowstrafficlarge scale optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (4)

A heuristic for the OD matrix adjustment problem in a congested transport network ⋮ Traffic sensor location using Wardrop equilibrium ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets

Uses Software

• Scilab
• CiudadSim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(n) algorithm for quadratic knapsack problems
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Computational study of state-of-the-art path-based traffic assignment algorithms
• On the convergence of descent methods for monotone variational inequalities
• A polynomially bounded algorithm for a singly constrained quadratic program
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Massively Parallel Algorithms for Singly Constrained Convex Programs

This page was built for publication: Issues in the implementation of the DSD algorithm for the traffic assignment problem