Used models and algorithms

Models

  • User Equilibrium (Traffic Assignment problem) or All-or-Nothing assignment
    • This model is computed by Dial’s B algorithm (Dial 2006) that is fully optimized and parallelized.
  • The network model can reflect
    • cost of turning, and
    • turning bans

Origin-Destination matrix estimation

  • calibration of Origin-Destination matrix (ODM) using traffic count – least squares method
    • computed by Spiess’s heuristic algorithm

Our publications

2021

Beran, D., Jedlička, K., Kumar, K., Popelka, S., & Stoter, J. The Third Dimension in Noise Visualization – a Design of New Methods for Continuous Phenomenon Visualization. The Cartographic Journal, 2021 Download

2020

Jedlicka, K., Beran, D., Martolos, J., Kolovský, F., Kepka, M., Mildorf, T., Sháněl, J. Traffic Modellingfor the Smart City of Pilsen. The 8th International Conference on Cartography and GIS 2020. Bulgaria Download

2019

Beran, D., Jedlička, K., Kolovský, F., Kepka, M., Martolos, J., Sháněl, J., Uhlíř, P., Bouchal, J. Interaktivní modelování dopravních intenzit. VŠB-TUO, Ostrava, Česká republika, 2019.

Kolovský, František. Algorithms in transportation. Plzeň, 2019. The State of the Art and Concept of PhD Thesis. University of West Bohemia. Supervisor Ivana Kolingerová. Download

2018

Kolovský, F., Ježek, J., and Kolingerová, I. (2018). The Origin-Destination matrix estimation for large transportation models in an uncongested network. In 2018 International Conference on Mathematical Applications, pages 17–22, Madeira – Portugal. Download

Literature

(Dial 2006) Dial, Robert B. “A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration.” Transportation Research Part B: Methodological 40.10 (2006): 917-936.

(Spiess 1990) Spiess, Heinz. “A gradient approach for the OD matrix adjustment problem.” (1990): 2.