{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:06:50Z","timestamp":1750309610236,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"European Social Fund via IT Academy programme","award":["SLTAT18447"],"award-info":[{"award-number":["SLTAT18447"]}]},{"name":"Estonian Centre of Excellence in IT (EXCITE)","award":["SLTAT16148T"],"award-info":[{"award-number":["SLTAT16148T"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,31]]},"DOI":"10.1145\/3672608.3707908","type":"proceedings-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T18:26:54Z","timestamp":1747247214000},"page":"1600-1608","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Refining Urban Microscopic Traffic Simulations Accuracy Using a Customized Random Walk Model for Dynamic Stochastic Route Choice"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4777-804X","authenticated-orcid":false,"given":"Kaveh","family":"Khoshkha","sequence":"first","affiliation":[{"name":"Institute of Computer Science, ITS Lab, University of Tartu, Tartu, Estonia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2092-816X","authenticated-orcid":false,"given":"Mozhgan","family":"Pourmoradnasseri","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, ITS Lab, University of Tartu, Tartu, Estonia"},{"name":"University Canada West, Vancouver, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8585-7879","authenticated-orcid":false,"given":"Behzad","family":"Bamdad Mehrabani","sequence":"additional","affiliation":[{"name":"Transport &amp; Mobility Leuven, Leuven, Belgium"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8939-8948","authenticated-orcid":false,"given":"Sadok","family":"Ben Yahia","sequence":"additional","affiliation":[{"name":"The Maersk Mc-Kinney Moller Institute, SDU Center for Industrial Software, Odense, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9257-3858","authenticated-orcid":false,"given":"Amnir","family":"Hadachi","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, ITS Lab, University of Tartu, Tartu, Estonia"}]}],"member":"320","published-online":{"date-parts":[[2025,5,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"An Efficient Simulation-Based Travel Demand Calibration Algorithm for Large-Scale Metropolitan Traffic Models. arXiv preprint arXiv:2109.11392","author":"Arora Neha","year":"2021","unstructured":"Neha Arora, Yi-fan Chen, Sanjay Ganapathy, Yechen Li, Ziheng Lin, Carolina Osorio, Andrew Tomkins, and Iveel Tsogsuren. 2021. An Efficient Simulation-Based Travel Demand Calibration Algorithm for Large-Scale Metropolitan Traffic Models. arXiv preprint arXiv:2109.11392 (2021)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2023.103922"},{"key":"e_1_3_2_1_3_1","unstructured":"Theophile Cabannes Alben Bagabaldo John Lee Qianxin Gan Ayush Jain Alice Blondel and Alexandre Bayen. 2023. Creating Calibrating and Validating Large-Scale Microscopic Traffic Simulation. (2023)."},{"key":"e_1_3_2_1_4_1","volume-title":"A Markovian approach for stochastic dynamic traffic assignment. Available at SSRN 4680654","author":"de la Paz Guala Ricardo","year":"2022","unstructured":"Ricardo de la Paz Guala, Cristi\u00e1n E Cort\u00e9s, Benjamin G Heydecker, and Pablo Rey. 2022. A Markovian approach for stochastic dynamic traffic assignment. Available at SSRN 4680654 (2022)."},{"key":"e_1_3_2_1_5_1","volume-title":"A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation research 5, 2","author":"Dial Robert B","year":"1971","unstructured":"Robert B Dial. 1971. A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation research 5, 2 (1971), 83\u2013111."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3141\/2567-09"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2013.07.012"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.03.001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3141\/2085-15"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(02)00009-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC55140.2022.9922566"},{"key":"e_1_3_2_1_13_1","volume-title":"Erald Keshi, and Shan Wu.","author":"Khoshkhah Kaveh","year":"2022","unstructured":"Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Amnir Hadachi, Helen Tera, Jakob Mass, Erald Keshi, and Shan Wu. 2022. Real-Time System for Daily Modal Split Estimation and OD Matrices Generation Using IoT Data: A Case Study of Tartu City. Sensors 22, 8 (2022). https:\/\/www.mdpi.com\/1424-8220\/22\/8\/3030"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Alexander Krylatov Victor Zakharov and Tero Tuovinen. 2020. Optimization models and methods for equilibrium traffic assignment. (2020).","DOI":"10.1007\/978-3-030-34102-2"},{"key":"e_1_3_2_1_15_1","volume-title":"Modeling stochastic route choice behaviors with equivalent impedance. Mathematical Problems in Engineering 2015","author":"Li Jun","year":"2015","unstructured":"Jun Li, Yulin Huang, and Xinjun Lai. 2015. Modeling stochastic route choice behaviors with equivalent impedance. Mathematical Problems in Engineering 2015 (2015)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11116-017-9799-6"},{"key":"e_1_3_2_1_17_1","unstructured":"Jun Li Songxin Xin and Chunlu Liu. 2005. An algorithm for logit network loading problem by topological sorting. (2005)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2018.8569938"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0804"},{"key":"e_1_3_2_1_20_1","volume-title":"On the analytical probabilistic modeling of flow transmission across nodes in transportation networks. Transportation research record 2676, 12","author":"Lu Jing","year":"2022","unstructured":"Jing Lu and Carolina Osorio. 2022. On the analytical probabilistic modeling of flow transmission across nodes in transportation networks. Transportation research record 2676, 12 (2022), 209\u2013225."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2015.03.015"},{"volume-title":"Algorithms and data structures: The basic toolbox","author":"Mehlhorn Kurt","key":"e_1_3_2_1_22_1","unstructured":"Kurt Mehlhorn, Peter Sanders, and Peter Sanders. 2008. Algorithms and data structures: The basic toolbox. Vol. 55. Springer."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/23249935.2023.2257805"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.52825\/scp.v3i.119"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2018.09.023"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2021.10.013"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.09.031"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1049\/smc2.12071"},{"key":"e_1_3_2_1_29_1","volume-title":"Michiel CJ Bliemer, and Michael GH Bell","author":"Raadsen Mark PH","year":"2020","unstructured":"Mark PH Raadsen, Michiel CJ Bliemer, and Michael GH Bell. 2020. Aggregation, disaggregation and decomposition methods in traffic assignment: historical perspectives and new trends. Transportation research part B: methodological 139 (2020), 199\u2013223."},{"key":"e_1_3_2_1_30_1","first-page":"339","article-title":"Literature review of traffic assignment: static and dynamic","volume":"2","author":"Saw Krishna","year":"2015","unstructured":"Krishna Saw, Bhimaji K Katti, and G Joshi. 2015. Literature review of traffic assignment: static and dynamic. International Journal of Transportation Engineering 2, 4 (2015), 339\u2013347.","journal-title":"International Journal of Transportation Engineering"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3141\/2029-03"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2018.04.006"},{"key":"e_1_3_2_1_33_1","volume-title":"Yechen Li, Yi fan Chen, and Ziheng Lin.","author":"Tomkins Andrew","year":"2021","unstructured":"Andrew Tomkins, Carolina Osorio, Iveel Tsogsuren, Neha Arora, Sanjay Ganapathy Subramaniam, Yechen Li, Yi fan Chen, and Ziheng Lin. 2021. An Efficient Simulation-Based Travel Demand Calibration Algorithm for Large-Scale Metropolitan Traffic Models. https:\/\/arxiv.org\/abs\/2109.11392"},{"key":"e_1_3_2_1_34_1","volume-title":"The complexity of enumeration and reliability problems. siam Journal on Computing 8, 3","author":"Valiant Leslie G","year":"1979","unstructured":"Leslie G Valiant. 1979. The complexity of enumeration and reliability problems. siam Journal on Computing 8, 3 (1979), 410\u2013421."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.03.011"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5194\/acp-24-807-2024"},{"key":"e_1_3_2_1_37_1","volume-title":"A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation science 34, 1","author":"Ziliaskopoulos Athanasios K","year":"2000","unstructured":"Athanasios K Ziliaskopoulos. 2000. A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transportation science 34, 1 (2000), 37\u201349."}],"event":{"name":"SAC '25: 40th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Catania International Airport Catania Italy","acronym":"SAC '25"},"container-title":["Proceedings of the 40th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3672608.3707908","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3672608.3707908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:57:33Z","timestamp":1750298253000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3672608.3707908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,31]]},"references-count":36,"alternative-id":["10.1145\/3672608.3707908","10.1145\/3672608"],"URL":"https:\/\/doi.org\/10.1145\/3672608.3707908","relation":{},"subject":[],"published":{"date-parts":[[2025,3,31]]},"assertion":[{"value":"2025-05-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}