Abstract
Multistage modeling of traffic flows began to actively develop in the 1970s. Transport modeling packages were created, which are based on a set of convex optimization problems, the sequential solution of which (with appropriate feedback mechanisms) converges to the desired equilibrium distribution. An alternative way is to try to find a general convex optimization problem, the solution of which will give the desired equilibrium. The current paper attempts to find sufficient conditions to guarantee that the alternative path will be successful. In particular, the article shows that one of the blocks of a multistage model can use a stable dynamics model (rather than the generally accepted Beckmann model), combined with the possibility to choose different types of users and vehicles.
This is a preview of subscription content, log in via an institution to check access.
REFERENCES
A. G. Wilson, Entropy in Urban and Regional Modeling (Pergamon, Oxford, 1970).
A. V. Gasnikov, S. L. Klenov, E. A., Nurminski, Ya. A. Kholodov, and N. B. Shamrai, Introduction to Mathematical Modeling of Traffic Flows, Ed. by A. V. Gasnikov (Mosk. Tsentr Neprer. Mat. Obrazovan., Moscow, 2013) [in Russian].
A. V. Gasnikov et al., “On a three-stage version of a stationary traffic flow model,” Mat. Model. 26 (6), 34–70 (2014).
A. V. Gasnikov et al., “Evolutionary interpretations of entropy model for correspondence matrix calculation,” Mat. Model. 28 (4), 111–124 (2016).
A. V. Gasnikov and E. V. Gasnikova, Models of Equilibrium Flow Distribution in Large Networks (Mosk. Fiz.-Tekh. Inst., Moscow, 2020) [in Russian].
A. V. Gasnikov, P. E. Dvurechensky, and I. N. Usmanova, “On the nontriviality of fast (accelerated) randomized methods,” Tr. Mosk. Fiz.-Tekh. Inst. 8 (2), 67–100 (2016).
A. V. Gasnikov and Yu. E. Nesterov, “Universal method for stochastic composite optimization problems,” Comput. Math. Math. Phys. 58 (1), 48–64 (2018).
A. S. Ivanova, et al., “Calibration of model parameters for computing the correspondence matrix for the Moscow City,” Computer 12 (5), 961–978 (2020).
E. V. Kotlyarova et al., “Finding equilibria in two-stage traffic assignment models,” Komp’yut. Issled. Model. 13 (2), 365–379 (2021).
E. V. Kotlyarova et al., “Proof of the connection between the Beckmann model with degenerate cost functions and the stable dynamics model,” Komp’yut. Issled. Model. 14 (2), 335–342 (2022).
M. B. Kubentaeva, https://github.com/MeruzaKub/TransportNet
V. V. Mazalov and Yu. V. Chirkova, Network Games (Lan’, 2022) [in Russian].
V. I. Shvetsov, “Mathematical modeling of traffic flows,” Autom. Remote Control 64 (11), 1651–1689 (2003).
S. D. Boyles, N. E. Lownes, and A. Unnikrishnan, Transportation Network Analysis, Vol. I: Static and Dynamic Traffic Assignment (2020).
J. De Cea, J. E. Fernandez, V. Dekock, and A. Soto, “Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes,” Transp. Rev. 25 (3), 293–317 (2005).
P. Dvurechensky, et al., “Primal-dual method for searching equilibrium in hierarchical congestion population games” (2016). arXiv:1606.08988
P. Dvurechensky, A. Gasnikov, and A. Kroshnin, “Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm” (2018). arXiv:1802.04367
P. Dvurechensky et al., “A stable alternative to Sinkhorn’s algorithm for regularized optimal transport,” International Conference on Mathematical Optimization Theory and Operations Research (Springer, Cham, 2020), pp. 406–423.
S. P. Evans, “Derivation and analysis of some models for combining trip distribution and assignment,” Transp. Res. 10 (1), 37–57 (1976).
E. Gasnikova et al., “An evolutionary view on equilibrium models of transport flows,” Mathematics 11 (4), 858 (2023).
D. Kamzolov, P. Dvurechensky, and A. Gasnikov, “Universal intermediate gradient method for convex problems with inexact oracle,” Optim. Methods Software 36, 1289–1316 (2021).
A. Kroshnin et al., “On the complexity of approximating Wasserstein barycenters,” Proc. Mach. Learn. Res. 97, 3530–3540 (2019).
M. Kubentayeva and A. Gasnikov, “Finding equilibria in the traffic assignment problem with primal-dual gradient methods for Stable Dynamics model and Beckmann model,” (2020). arXiv:2008.02418
Y. Nesterov, “Universal gradient methods for convex optimization problems,” Math. Program. 152 (1–2), 381–404 (2015).
Y. Nesterov et al., “Primal-dual accelerated gradient methods with small-dimensional relaxation oracle,” Optim. Methods Software 36, 773–810 (2021).
Y. Nesterov and A. De Palma, “Stationary dynamic solutions in congested transportation networks: Summary and perspectives,” Networks Spatial Econ. 3 (3), 371–395 (2003).
J. D. Ortuzar and L. G. Willumsen, Modelling Transport (Wiley, New York, 2002).
M. Patriksson, The Traffic Assignment Problem: Models and Methods (Dover, New York, 2015).
G. Peyre and M. Cuturi, “Computational optimal transport: With applications to data science,” Found. Trends Mach. Learn. 11 (5–6), 355–607 (2019).
W. Sandholm, Population Games and Evolutionary Dynamics (MIT, Cambridge, Mass., 2010).
B. Stabler, H. Bar-Gera, and E. Sall, “Transportation networks for research core team,” Transportation Networks for Research. https://github.com/bstabler/TransportationNetworks
ACKNOWLEDGMENTS
The theoretical research was carried out as part of a state assignment from the Ministry of Science and Higher Education of the Russian Federation (project тo. 0714-2020-0005) together with the Russian University of Transport, which kindly provided the team with data for calculations. In particular, personal thanks to Aleksei Vyacheslavovich Shurupov, Vladimir Ivanovich Shvetsov, and Leonid Mikhailovich Baryshev, as well as Vladimir Viktorovich Mazalov for valuable advice that helped to better formalize the result (7).
Funding
The practical part of the research was carried out with the support of the annual income of the Federal Central Committee of MIPT (target capital тo. 5 for the development of areas of artificial intelligence and machine learning at MIPT).
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
The authors declare that they have no conflict of inte-rest.
Additional information
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Gasnikova, E.V., Gasnikov, A.V., Yarmoshik, D.V. et al. Multistage Transportation Model and Sufficient Conditions for Its Potentiality. Dokl. Math. 108 (Suppl 1), S139–S144 (2023). https://doi.org/10.1134/S1064562423600860
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562423600860