# Origin-Destination Matrix Estimation Problem in a Markov Chain Approach

## Abstract

In this paper, a Markov chain origin-destination matrix estimation problem is investigated in which the average time between two incoming streams to or outgoing streams from nodes in consecutive time periods is considered as a Markov chain. Along with, a normal distribution with pre-determined parameters in each period is considered for traffic counts on links. A bi-level programming problem is introduced where in its upper level the network flow pattern in the *n* th period is estimated so that the probability of the estimated traffic counts is maximized, while in the lower level a traffic assignment problem with the equilibrium conditions is solved. We reduce the proposed nonlinear bi-level model to a new one level linear programming problem, where by using a trust-region method the local optimal solutions are obtained. Some numerical examples are provided to illustrate the efficiency of the proposed method.

## Keywords

Origin-destination matrix Trust-region method Markov chain Traffic counts User-equilibrium assignment## Notes

## References

- Abareshi M, Zaferanieh M, Keramati B (2017) Path flow estimator in an entropy model using a nonlinear L-shaped algorithm. Netw Spatial Econ 17:293–315Google Scholar
- Akcelik R, Chung E (1994) Calibration of the bunched exponential distribution of arrival headways. Road and Transport Research 3:42–59Google Scholar
- Bell MGH, Shield CM (1995) A log-linear model for path flow estimation. In: Proceedings of the 4th international conference on the applications of advanced technologies in transportation engineering. ASCE, Carpi, pp 695–699Google Scholar
- Carey M, Hendrickson C, Siddharthan K (1981) A method for direct estimation of origin/destination trip matrices. Transp Sci 15:32–49Google Scholar
- Cascetta E, Nguyen S (1988) A unified framework for estimating or updating origin-destination matrices from traffic counts. Transp Res Part B 22:437–455Google Scholar
- Chen X, Li L, Zhang Y (2010) A Markov model for headway/spacing distribution of road traffic. IEEE Trans Intell Transp Syst 11:773–785Google Scholar
- Chen A, Chootinan P, Recker W (2005) Examining the quality of synthetic origin-destination trip table estimated by path flow estimator. J Transp Eng 131:506–513Google Scholar
- Chen A, Chootinan P, Recker W (2009) Norm approximation method for handling traffic count inconsistencies in path flow estimator. Transp Res Part B 43:852–872Google Scholar
- Chen A, Ryu S, Chootinan P (2010)
*L*_{∞}-norm path flow estimator for handling traffic count inconsistencies: formulation and solution algorithm. J Transp Eng 136:565–575Google Scholar - Cho HJ, Jou YJ, Lan CL (2009) Time dependent origin-destination estimation from traffic count without prior information. Netw Spatial Econ 9:145–170Google Scholar
- Chootinan P, Chen A, Recker W (2005) Improved path flow estimator for origin-destination trip tables. Transp Res Rec 1923:9–17Google Scholar
- Ching W, Scholtes S, Zhang S (2004) Numerical algorithms for dynamic traffic demand estimation between zones in a network. Eng Optim 36:379–400Google Scholar
- Colson B, Marcotte P, Savard G (2005) A trust-region method for nonlinear bi-level programming: algorithm and computational experience. Comput Optim Appl 30:211–227Google Scholar
- Conn AR, Gould NI, Toint PL (2000) Trust region methods. SIAMGoogle Scholar
- Dempe S (2002) Foundations of bi-level programming. Springer, USGoogle Scholar
- Eppstein D (1998) Finding the K-shortest paths. SIAM J Comput 28:652–673Google Scholar
- Fisk CS (1988) On combining maximum entropy trip matrix estimation with user optimal assignment. Transp Res Part B 22:69–73Google Scholar
- Florian M, Chen Y (1995) A coordinate descent method for the bi-level O-D matrix adjustment problem. Int Trans Oper Res 2:165–179Google Scholar
- Gardner WA (1990) Introduction to random processes: with applications to signals and systems, 2nd edn. McGraw-Hill, New YorkGoogle Scholar
- Ghiasi A, Hussain O, Qian Z, Li X (2017) A mixed traffic capacity analysis and lane management model for connected automated vehicles: a Markov chain method. Transp Res Part B 106:266–292Google Scholar
- de Grange L, Gonzalez F, Bekhor S (2017) Path flow and trip matrix estimation using link flow density. Netw Spatial Econ 17:173–195Google Scholar
- Jornsten K, Nguyen S (1979) On the estimation of a trip matrix from network data. Technical report, LiTH-MAT-R-79-36 Department of Mathematics. University of Linkoping, SwedenGoogle Scholar
- Klenke A (2014) Probability theory: a comprehensive course. Springer-Verlag, LondonGoogle Scholar
- Li B (2009) Markov models for Bayesian analysis about transit route origin-destination matrices. Transp Res Part B 43:301–310Google Scholar
- Li L, Chen X (2017) Vehicle headway modeling and its inferences in macroscopic/microscopic traffic flow theory: A survey. Transp Res Part C 76:170–188Google Scholar
- Marcotte P, Savard G, Zhu DL (2001) A trust-region algorithm for nonlinear bi-level programming. Oper Res Lett 29:171–179Google Scholar
- McNeil S, Hendrickson C (1985) A regression formulation of the matrix estimation problem. Transp Sci 19:278–292Google Scholar
- Miller S, Childers D (2012) Probability and random processes: with applications to signal processing and communications, 2nd edn. Academic Press, CambridgeGoogle Scholar
- Nie Y, Zhang HM, Recker WW (2005) Inferring origin-destination trip matrices with a decoupled GLS path flow estimator. Transp Res Part B 39:497–518Google Scholar
- Nie Y, Zhang HM (2010) A relaxation approach for estimating origin-destination trip tables. Netw Spatial Econ 10:147–172Google Scholar
- Nie Y, Zhang HM (2008) A variational inequality formulation for inferring dynamic origin-destination travel demands. Transp Res Part B 42:635–662Google Scholar
- Nguyen S (1977) Estimating an O-D matrix from network data: a network equilibrium approach. Technical report 60, University of MontrealGoogle Scholar
- Nocedal J, Wright S (2006) Numerical Optimization, 2nd edn. Springer-Verlag, New YorkGoogle Scholar
- Parry K, Hazelton ML (2013) Bayesian inference for day-to-day dynamic traffic models. Transp Res Part B 50:104–115Google Scholar
- Scholtes S, Stohr M (1999) Exact penalization of mathematical programs with equilibrium constraints. SIAM J Control Optim 37:617–652Google Scholar
- Spiess H (1987) A maximum likelihood model for estimating origin-destination matrices. Transp Res Part B 21:395–412Google Scholar
- Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall, New JerseyGoogle Scholar
- Shen W, Wynter L (2012) A new one-level convex optimization approach for estimating origin-destination demand. Transp Res Part B 46:1535–1555Google Scholar
- Sherali HD, Sivanandan R, Hobeika AG (1994) A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes. Transp Res Part B 28:213–233Google Scholar
- Van Zuylen H, Willumsen LG (1980) The most likely trip matrix estimated from traffic counts. Transp Res Part B 14:281–293Google Scholar
- Wardrop J (1952) Some theoretical aspects of road traffic research. In: Proceedings of the institution of civil engineers, pp 325–378Google Scholar
- Willumsen LG (1981) Simplified transport models based on traffic counts. Transportation 10:257–278Google Scholar
- Wu ZX, Lam WHK (2006) Transit passenger origin-destination estimation in congested transit networks with elastic line frequencies. Ann Oper Res 144:363–378Google Scholar
- Xie C, Duthie J (2015) An excess-demand dynamic traffic assignment approach for inferring origin-destination trip matrices. Netw Spatial Econ 15:947–979Google Scholar
- Yang H, Sasaki T, Iida Y, Asakura Y (1992) Estimation of origin-destination matrices from link traffic counts on congested networks. Transp Res Part B 26:417–434Google Scholar