Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem

Autor:	Gasnikova, Evgenia, Gasnikov, Alexander, Yarmoshik, Demyan, Kubentaeva, Meruza, Persiianov, Michael, Podlipnova, Irina, Kotlyarova, Ekaterina, Sklonin, Ilya, Podobnaya, Elena, Matyukhin, Vladislav
Jazyk:	ruština
Rok vydání:	2023
Předmět:	Mathematics - Optimization and Control
Druh dokumentu:	Working Paper
Popis:	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. Comment: 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)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2305.09069 Zobrazit plný text záznamu View this record from Arxiv