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

arXiv2305.09069MaRDI QIDQ6436740FDOQ6436740

Author name not available (Why is that?), Author name not available (Why is that?), Michael Persiianov, Author name not available (Why is that?), Evgenia Gasnikova, Author name not available (Why is that?), A. V. Gasnikov, Author name not available (Why is that?), Author name not available (Why is that?), Meruza Kubentaeva

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)