Parallel optimization for traffic assignment
Most large-scale optimization problems exhibit structures that allows the possibility of attack via algorithms that exhibit a high level of parallelism. The emphasis of this paper is the development of parallel optimization algorithms for a class of convex, block-structured problems. Computational experience is cited for some large-scale problems arising from traffic assignment applications. The algorithms considered here have the property that they allow such problems to be decomposed into a set of smaller optimization problems at each major iteration. These smaller problems correspond to linear single-commodity networks in the traffic assignment case, and they may be solved in parallel. Results are given for the distributed solution of such problems on the CRYSTAL multicomputer.
- Distributed disaggregate simplicial decomposition - A parallel algorithm for traffic assignment
- scientific article; zbMATH DE number 1163097
- A parallel approach to large-scale nonlinear network optimization
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- scientific article; zbMATH DE number 795218
- Decomposition algorithm for convex differentiable minimization
- A unified description of iterative algorithms for traffic equilibria
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
- A Parallel Routing Algorithm for Traffic Optimization
- Network flow assignment as a fixed point problem
- Parallel Auction Algorithm for Bus Rescheduling
- Distributed disaggregate simplicial decomposition - A parallel algorithm for traffic assignment
- scientific article; zbMATH DE number 1163097 (Why is no real title available?)
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
- An alternating direction method of multipliers for solving user equilibrium problem
- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
- A distributed computing method integrating improved gradient projection for solving stochastic traffic equilibrium problem
- A survey of dynamic network flows
This page was built for publication: Parallel optimization for traffic assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116876)