Distributed disaggregate simplicial decomposition - A parallel algorithm for traffic assignment

MaRDI QIDQ4363165zbMATH OpenFDO

Authors Olof Damberg, Athanasios Migdalas

Publication date 1 November 1998

zbMATH Keywords

column generationequilibrium traffic assignmentnonlinear, convex, uncapacitated multicommodity network flowparallel algorithmparallel computersregularized Frank-Wolfe algorithmsimplicial decompositiontransportation network equilibrium

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Deterministic network models in operations research (90B10) Applications of mathematical programming (90C90)

Recommendations

• Parallel optimization for traffic assignment
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• scientific article; zbMATH DE number 1163097
• A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network

Cited in

(7)

• Parallel optimization for traffic assignment
• A massively parallel implementation of a discrete-time algorithm for the computation of dynamic elastic demand traffic problems modeled as projected dynamical systems
• A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
• Bilevel programming in traffic planning: Models, methods and challenge
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Massively parallel computation of dynamic traffic networks modeled as projected dynamical systems
• Parallel implementation of the TRANSIMS micro-simulation

This page was built for publication: Distributed disaggregate simplicial decomposition - A parallel algorithm for traffic assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363165)