OD-MATRIX ESTIMATION IN MEGAPOLIS TRANSPORTATION NETWORK
Anastasia P. Shirokolobova, Saint Petersburg State University, Saint-Petersburg, email@example.com
The reported study was funded by RFBR according to the research project ¹ 18-31-00178
This paper surveys the methodology of estimation the volumes of travel demand between origins and destinations (OD) in transportation networks of general topology, which is named the problem of OD-matrix estimation. The developed bi-level model is based on a dual formulation of the traffic assignment problem. The dual problem on the lower level of the model allows finding the equilibrium travel time between OD-pairs. The solution of dual problem is the equal journey time by alternative routes between any OD-pair under the assumption of first principle of Wardrop equilibrium. Such a bi-level model makes it possible to estimate OD-matrix in accordance with the actual traffic situation. The developed method was experimentally implemented to the Saint-Petersburg road network. As an optimization method for finding solutions, a meta-heuristic evolutionary algorithm is chosen. The obtained results demonstrate the effectiveness of the developed approach.
Keywords: user equilibrium, traffic assignment, dual theory, nonlinear constrained optimization, OD-matrix, information technologies in transport.
1. Wardrop J.G. (1952). Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers. Vol.1, No.3, pp. 325-362.
2. Beckman M., McGuire C.B., Winsten C.B. (1955). Studies in economics of transportation. RM-1488. Santa Monica: RAND Corporation. 249 p.
3. Di X., Liu H.X. (2016). Boundedly rational route choice behavior: A review of models and methodologies. Transportation Research Part B. No.85, pp.142- 79.
4. Zakharov V.V, Krylatov A.Yu. (2014). Modern problems of using the intellectual base of mathematical modeling in the fight against congestion in large cities of Russia. Transport of the Russian Federation. No. 4(53), pp. 69-73. (in Russian)
5. Krylatov A.Yu. (2016). Network flow assignment as a fixed point problem. Journal of Applied and Industrial Mathematics. 10 (2), pp. 243-256.
6. Patriksson M. (1994). The Traffic Assignment Problem: Models and Methods. Utrecht, Netherlands: VSP. 223 p.
7. Sheffi Y. (1985). Urban transportation networks: equilibrium analysis with mathematical programming methods. N.J.: Prentice-Hall, Inc, Englewood Cliffs. 416 p.
8. Krylatov A.Yu., Shirokolobova A.P., Zakharov V.V. (2016). OD-matrix estimation based on a dual formulation of traffic assignment problem. Informatica (Slovenia). Vol. 40, No.4, pp. 393-398.
9. Tyniansky N.T. (1968). Non-linear programming and differential games duality theory fundamentals. Moscow: The printing house of the F.E. Dzerzhinsky Military Engineering Academy. 160 p. (in Russian)
10. Dijkstra E.W. (1959). A note on two problems in connexion with graphs. Numer. Math. Springer Science Business Media. Vol.1, No.1. pp. 269-271.
11. Beyer H.-G., Schwefel H.-P. (2002). Evolution strategies. Natural Computing. No.1, pp. 3-52.
12. Eiben A.E., Smith J.E. (2003). Introduction to Evolutionary Computing (1st edition ed.). Springer. 272 p.
13. Horowitz A.J. (1991). Delay/Volume Relations for Travel Forecasting Based upon the 1985 Highway Capacity Manual. Milwaukee: Department of Civil Engineering and Mechanics University of Wisconsin — Milwaukee. 87 p.
Information about author:
Anastasia P. Shirokolobova, assistant professor, Saint Petersburg State University Russia, Saint Petersburg, Russia