Finding flow equilibrium with projective methods with decomposition and route generation

Authors:
N. B. Shamrai
Affiliations:
Institute of Automation and Control Processes, Far-Eastern Branch, Russian Academy of Sciences, Vladivostok, Russia
Venue:
Automation and Remote Control
Year:
2012

Citing 7
Cited 0

A finite algorithm for finding the projection of a point onto the Canonical simplex of Rn

Journal of Optimization Theory and Applications
Unified framework of extragradient-type methods for pseudomonotone variational inequalities

Journal of Optimization Theory and Applications
Origin-Based Algorithm for the Traffic Assignment Problem

Transportation Science
Some recent advances in projection-type methods for variational inequalities

Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Mathematical Modeling of Traffic Flows

Automation and Remote Control
Algorithms for distributing traffic flows

Automation and Remote Control
Envelope stepsize control for iterative algorithms based on Fejer processes with attractants

Optimization Methods & Software - DEDICATED TO PROFESSOR VLADIMIR F. DEMYANOV ON THE OCCASION OF HIS 70TH BIRTHDAY

Quantified Score

Hi-index	0.00

Visualization

Abstract

To solve asymmetric traffic equilibrium problems, we propose to apply projective methods together with the ideas of decomposing the admissible set and iteratively generating routes for flow-generating pairs. Along with projective and extragradient methods, we consider the projective method with a stepwise step control based on the theory of Fejer processes with small perturbations. We show results of numerical experiments on the traffic network of the city of Vladivostok.