Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem
From MaRDI portal
Publication:6436740
arXiv2305.09069MaRDI QIDQ6436740FDOQ6436740
Authors: Evgenia Gasnikova, A. V. Gasnikov, Meruza Kubentaeva, Michael Persiianov 
Publication date: 15 May 2023
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.
This page was built for publication: Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6436740)
