Calibration of model parameters for calculating correspondence matrix for Moscow

Ivanova A.S., Omelchenko S.S., Kotliarova E.V., Matyukhin V.V.
 pdf (349K)

In this paper, we consider the problem of restoring the correspondence matrix based on the observations of real correspondences in Moscow. Following the conventional approach [Gasnikov et al., 2013], the transport network is considered as a directed graph whose edges correspond to road sections and the graph vertices correspond to areas that the traffic participants leave or enter. The number of city residents is considered constant. The problem of restoring the correspondence matrix is to calculate all the correspondence from the $i$ area to the $j$ area.

To restore the matrix, we propose to use one of the most popular methods of calculating the correspondence matrix in urban studies — the entropy model. In our work, which is based on the work [Wilson, 1978], we describe the evolutionary justification of the entropy model and the main idea of the transition to solving the problem of entropy-linear programming (ELP) in calculating the correspondence matrix. To solve the ELP problem, it is proposed to pass to the dual problem. In this paper, we describe several numerical optimization methods for solving this problem: the Sinkhorn method and the Accelerated Sinkhorn method. We provide numerical experiments for the following variants of cost functions: a linear cost function and a superposition of the power and logarithmic cost functions. In these functions, the cost is a combination of average time and distance between areas, which depends on the parameters. The correspondence matrix is calculated for multiple sets of parameters and then we calculate the quality of the restored matrix relative to the known correspondence matrix.

We assume that the noise in the restored correspondence matrix is Gaussian, as a result, we use the standard deviation as a quality metric. The article provides an overview of gradient-free optimization methods for solving non-convex problems. Since the number of parameters of the cost function is small, we use the grid search method to find the optimal parameters of the cost function. Thus, the correspondence matrix calculated for each set of parameters and then the quality of the restored matrix is evaluated relative to the known correspondence matrix. Further, according to the minimum residual value for each cost function, we determine for which cost function and at what parameter values the restored matrix best describes real correspondence.

Keywords: correspondence matrix calculation model, entropy linear programming, Sinkhorn method, accelerated Sinkhorn method
Citation in English: Ivanova A.S., Omelchenko S.S., Kotliarova E.V., Matyukhin V.V. Calibration of model parameters for calculating correspondence matrix for Moscow // Computer Research and Modeling, 2020, vol. 12, no. 5, pp. 961-978
Citation in English: Ivanova A.S., Omelchenko S.S., Kotliarova E.V., Matyukhin V.V. Calibration of model parameters for calculating correspondence matrix for Moscow // Computer Research and Modeling, 2020, vol. 12, no. 5, pp. 961-978
DOI: 10.20537/2076-7633-2020-12-5-961-978
URL: http://crm-en.ics.org.ru/journal/article/2977/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science