Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem
Optimization and Control
2023-05-31 v3
Abstract
In this paper we consider multi-stages traffic assignment with several demand layers, user types and network types. We consider two stages: demand matrix calculation (Entropy Wilson's model) and traffic assignment models (Beckmann or Nesterov--de Palma). For the traffic assignment stage we use dual reformulation and combine these stages as a saddle-point problem (convex-concave). Then we discuss how one can solve this problem numerically.
Cite
@article{arxiv.2305.09069,
title = {Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem},
author = {Evgenia Gasnikova and Alexander Gasnikov and Demyan Yarmoshik and Meruza Kubentaeva and Michael Persiianov and Irina Podlipnova and Ekaterina Kotlyarova and Ilya Sklonin and Elena Podobnaya and Vladislav Matyukhin},
journal= {arXiv preprint arXiv:2305.09069},
year = {2023}
}
Comments
in Russian language. This research was supported by the annual income of the MIPT Foundation (Endowment No. 5 for the development of artificial intelligence and machine learning at MIPT)