Summary
This chapter describes a combined genetic computation approach for estimating time-varying Origin-Destination (O-D) trip demand matrices from traffic counts in urban networks. The estimation procedure combines a microscopic model simulating traffic flow conditions with a genetic algorithm to synthesize the network O-D trip matrix, through determining the turning flow proportions at each intersection. The proposed approach avoids the restrictions involved in employing a user-optimal Dynamic Traffic Assignment (DTA) procedure and carries out a stochastic global search of the optimal O-D trip and turning flow distributions. The multi-objective, single-level optimization formulation of the problem provides a mutually consistent solution between the resulting O-D matrix and path/link flow pattern, which minimizes the difference between estimated and observed link flows. The model implementation into a real arterial sub-network demonstrates its ability to microscopically estimate trip demand with satisfactory accuracy and fast computing speeds which allow its usage in dynamic urban traffic operations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ashok, K., Ben-Akiva, M.E.: Dynamic O-D matrix estimation and prediction for real-time traffic management systems. In: Daganzo, C.F. (ed.) Proceedings of the 12th International Symposium on Transportation and Traffic Theory, pp. 465–484. Elsevier, New York (1993)
Bell, M.G.H.: The real time estimation of origin-destination flows in the presence of platoon dispersion. Transportation Research, Part B: Methodological 25(2/3), 115–125 (1991)
Ben-Akiva, M., Bierlaire, M., Burton, D., Koutsopoulos, H.N., Mishalani, R.: Network state estimation and prediction for real-time traffic management. Networks and Spatial Economics 1, 293–318 (2001)
Cascetta, E., Inaudi, D., Marquis, G.: Dynamic estimators of origin-destination matrices using traffic counts. Transportation Science 27, 363–373 (1993)
Coello, C.A., Lamont, G.B., van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems. Springer, New York (2006)
Cremer, M., Keller, H.: A new class of dynamic methods for the identification of origin-destination flows. Transportation Research, Part B: Methodological 21(2), 117–132 (1987)
Diakaki, C., Papageorgiou, M., Aboudolas, K.: A multivariable regulator approach to traffic-responsive network-wide signal control. Control Engineering Practice 10(2), 183–195 (2002)
Dimitriou, L., Tsekeris, T., Stathopoulos, A.: Genetic-algorithm-based micro-simulation approach for estimating turning proportions at signalized intersections. In: van Zuylen, H., Middelham, F. (eds.) Proceedings of the 11th IFAC Symposium on Control in Transportation Systems, pp. 159–164. Delft, The Netherlands (2006)
Federal Highway Administration. Traffic Network Analysis with NETSIM – A User Guide. Federal Highway Administration, U.S. Dept. of Transportation, Washington (1980)
Fisk, C.S.: On combining maximum entropy trip matrix estimation with user optimal assignment. Transportation Research, Part B: Methodological 22, 69–73 (1988)
Florian, M., Chen, Y.: A coordinate descent method for the bi-level O-D matrix adjustment problem. International Transactions in Operational Research 2, 165–179 (1995)
Gartner, N.H., Pooran, F.J., Andrews, C.M.: Implementation of the OPAC adaptive control strategy in a traffic signal network. In: Proceedings of the 4th IEEE Conference on Intelligent Transportation Systems, pp. 197–202. IEEE, Oakland (2001)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
He, R.R., Kornhauser, A.L., Ran, B.: Estimation of time-dependent O-D demand and route choice from link flows. In: Proceedings of the 81st Annual Meeting of the Transportation Research Board, National Research Council, Washington (2002)
Holland, J.H.: Adaptation in Natural and Artificial Systems, 2nd edn. MIT Press, Cambridge (1992)
Kim, H., Baek, S., Lim, Y.: Origin-destination matrices estimated with a genetic algorithm from link traffic counts. Transportation Research Record 1771, 156–163 (2001)
Lan, C.J., Davis, G.A.: Real-time estimation of turning movement proportions from partial counts on urban networks. Transportation Research, Part C 7(5), 305–327 (1999)
Luk, J.Y.K.: Two traffic-responsive area traffic control methods: SCAT and SCOOT. Traffic Engineering and Control 25, 14–22 (1984)
Martin, P.T.: Turning movement estimation in real time. Journal of Transportation Engineering 123(4), 252–260 (1997)
Nihan, N.L., Davis, G.A.: Recursive estimation of origin-destination matrices from input/output counts. Transportation Research, Part B: Methodological 21(2), 149–163 (1987)
Nihan, N.L., Davis, G.A.: Application of prediction-error minimization and maximum likelihood to estimate intersection O-D matrices from traffic counts. Transportation Science 23(2), 77–90 (1989)
Reeves, C.R., Rowe, J.E.: Genetic Algorithms – Principles and Perspectives: A Guide to GA Theory. Kluwer, Boston (2002)
Stathopoulos, A., Tsekeris, T.: Hybrid meta-heuristic algorithm for the simultaneous optimization of the O-D trip matrix estimation. Computer-Aided Civil and Infrastructure Engineering 19, 421–435 (2004)
Tavana, H., Mahmassani, H.: Estimation of dynamic origin-destination flows from sensor data using bi-level optimization method. In: Proceedings of the 80th Annual Meeting of the Transportation Research Board, National Research Council, Washington (2001)
Tsekeris, T., Dimitriou, L., Stathopoulos, A.: A simultaneous origin-destination matrix estimation in dynamic traffic networks with evolutionary computing. In: Giacobini, M., et al. (eds.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 668–677. Springer, Berlin (2007)
Tsekeris, T., Stathopoulos, A.: A real-time dynamic origin-destination matrices from link traffic counts on congested networks. Transportation Research Record 1857, 117–127 (2003)
van der Zijpp, N., Lindveld, C.D.R.: Estimation of origin-destination demand for dynamic assignment with simultaneous route and departure time choice. Transportation Research Record 1771, 75–82 (2001)
Yang, H., Bell, M.G.H.: Transport bilevel programming problems: Recent methodological advances. Transportation Research, Part B: Methodological 35, 1–4 (2001)
Yang, H., Sasaki, T., Asakura, Y.: Estimation of origin-destination matrices from link traffic counts on congested networks. Transportation Research, Part B: Methodological 26, 417–434 (1992)
Zhang, X., Maher, M.: An algorithm for the solution of bi-level programming problems in transport network analysis. In: Griffiths, J.D. (ed.) Mathematics in Transport Planning and Control, pp. 177–186. Pergamon, Oxford (1998)
Ziliaskopoulos, A.K., Peeta, S.: Review of dynamic traffic assignment models. Networks and Spatial Economics 1, 233–267 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tsekeris, T., Dimitriou, L., Stathopoulos, A. (2008). Combined Genetic Computation of Microscopic Trip Demand in Urban Networks. In: Fink, A., Rothlauf, F. (eds) Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management. Studies in Computational Intelligence, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69390-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-69390-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69024-5
Online ISBN: 978-3-540-69390-1
eBook Packages: EngineeringEngineering (R0)