{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T17:06:42Z","timestamp":1756573602489,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L016400\/1"],"award-info":[{"award-number":["EP\/L016400\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1145\/3486629.3490691","type":"proceedings-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T23:07:41Z","timestamp":1637276861000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Collective shortest paths for minimizing congestion on temporal load-aware road networks"],"prefix":"10.1145","author":[{"given":"Chris","family":"Conlan","sequence":"first","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teddy","family":"Cunningham","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunduz Vehbi","family":"Demirci","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Ferhatosmanoglu","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.12.043"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Florian Barth and Stefan Funke. 2019. Alternative Routes for Next Generation Traffic Shaping. In ACM SIGSPATIAL. 1--8.  Florian Barth and Stefan Funke. 2019. Alternative Routes for Next Generation Traffic Shaping. In ACM SIGSPATIAL. 1--8.","DOI":"10.1145\/3357000.3366141"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2017.05.004"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1369-8478(00)00005-X"},{"key":"e_1_3_2_1_5_1","volume-title":"Controlling congestion on complex networks: fairness, efficiency and network structure. Scientific reports 7, 1","author":"Buzna Lubo\u0161","year":"2017","unstructured":"Lubo\u0161 Buzna and Rui Carvalho . 2017. Controlling congestion on complex networks: fairness, efficiency and network structure. Scientific reports 7, 1 ( 2017 ), 1--15. Lubo\u0161 Buzna and Rui Carvalho. 2017. Controlling congestion on complex networks: fairness, efficiency and network structure. Scientific reports 7, 1 (2017), 1--15."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Dan Cheng Olga Gkountouna Andreas Z\u00fcfle Dieter Pfoser and Carola Wenk. 2019. Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study. In ACM SIGSPATIAL IWCTS. 1--10.  Dan Cheng Olga Gkountouna Andreas Z\u00fcfle Dieter Pfoser and Carola Wenk. 2019. Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study. In ACM SIGSPATIAL IWCTS. 1--10.","DOI":"10.1145\/3357000.3366137"},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Understanding congested travel in urban areas","volume":"7","author":"\u00c7olak Serdar","year":"2016","unstructured":"Serdar \u00c7olak , Antonio Lima , and Marta C Gonz\u00e1lez . 2016 . Understanding congested travel in urban areas . Nature 7 , 1 (2016), 1 -- 8 . Serdar \u00c7olak, Antonio Lima, and Marta C Gonz\u00e1lez. 2016. Understanding congested travel in urban areas. Nature 7, 1 (2016), 1--8.","journal-title":"Nature"},{"key":"e_1_3_2_1_9_1","volume-title":"Shortest paths in FIFO time-dependent networks: Theory and algorithms. Rapport Technique","author":"Dean Brian C","year":"2004","unstructured":"Brian C Dean . 2004. Shortest paths in FIFO time-dependent networks: Theory and algorithms. Rapport Technique ( 2004 ), 13. Brian C Dean. 2004. Shortest paths in FIFO time-dependent networks: Theory and algorithms. Rapport Technique (2004), 13."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Ugur Demiryurek Farnoush Banaei-Kashani and Cyrus Shahabi. 2010. A case for time-dependent shortest path computation in spatial networks. In ACM SIGSPATIAL. 474--477.  Ugur Demiryurek Farnoush Banaei-Kashani and Cyrus Shahabi. 2010. A case for time-dependent shortest path computation in spatial networks. In ACM SIGSPATIAL. 474--477.","DOI":"10.1145\/1869790.1869865"},{"key":"e_1_3_2_1_11_1","unstructured":"Department for Transport. [n.d.]. The Highway Code. https:\/\/www.gov.uk\/guidance\/the-highway-code\/  Department for Transport. [n.d.]. The Highway Code. https:\/\/www.gov.uk\/guidance\/the-highway-code\/"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Edsger W Dijkstra etal 1959. A note on two problems in connexion with graphs. Numerische mathematik 1 1 (1959) 269--271.  Edsger W Dijkstra et al. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1 1 (1959) 269--271.","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3233\/IDT-170288"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0001-4575(97)00005-5"},{"volume-title":"Retrieved","year":"2015","key":"e_1_3_2_1_15_1","unstructured":"Geolink. 2015 . ECML\/PKDD 15: Taxi Trajectory Prediction . Retrieved August 15, 2019 from http:\/\/www.geolink.pt\/ecmlpkdd2015-challenge\/dataset.html Geolink. 2015. ECML\/PKDD 15: Taxi Trajectory Prediction. Retrieved August 15, 2019 from http:\/\/www.geolink.pt\/ecmlpkdd2015-challenge\/dataset.html"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Betsy George and Shashi Shekhar. 2008. Time-Aggregated Graphs for Modeling Spatio-Temporal Networks. 191--212.  Betsy George and Shashi Shekhar. 2008. Time-Aggregated Graphs for Modeling Spatio-Temporal Networks. 191--212.","DOI":"10.1007\/978-3-540-92148-6_7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.2983434"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0197"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2476958"},{"key":"e_1_3_2_1_21_1","unstructured":"David Levinson. 2018. How much time is spent at traffic signals? https:\/\/transportist.org\/2018\/03\/06\/how-much-time-is-spent-at-traffic-signals\/  David Levinson. 2018. How much time is spent at traffic signals? https:\/\/transportist.org\/2018\/03\/06\/how-much-time-is-spent-at-traffic-signals\/"},{"key":"e_1_3_2_1_22_1","volume-title":"Mohamed Abdur Rahman, and Saleh Basalamah.","author":"Madkour Amgad","year":"2017","unstructured":"Amgad Madkour , Walid G Aref , Faizan Ur Rehman , Mohamed Abdur Rahman, and Saleh Basalamah. 2017 . A survey of shortest-path algorithms. (2017). arXiv:1705.02044 Amgad Madkour, Walid G Aref, Faizan Ur Rehman, Mohamed Abdur Rahman, and Saleh Basalamah. 2017. A survey of shortest-path algorithms. (2017). arXiv:1705.02044"},{"volume-title":"Traffic flow fundamentals","author":"May Adolf Darlington","key":"e_1_3_2_1_23_1","unstructured":"Adolf Darlington May . 1990. Traffic flow fundamentals . Prentice Hall , Chapter 10. Adolf Darlington May. 1990. Traffic flow fundamentals. Prentice Hall, Chapter 10."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Sadegh Motallebi Hairuo Xie Egemen Tanin and Kotagiri Ramamohanarao. 2020. Streaming route assignment with prior temporal traffic data. In ACM SIGSPATIAL IWCTS. 1--10.  Sadegh Motallebi Hairuo Xie Egemen Tanin and Kotagiri Ramamohanarao. 2020. Streaming route assignment with prior temporal traffic data. In ACM SIGSPATIAL IWCTS. 1--10.","DOI":"10.1145\/3423457.3429369"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Uyen TV Nguyen Shanika Karunasekera Lars Kulik Egemen Tanin Rui Zhang Haolan Zhang Hairuo Xie and Kotagiri Ramamohanarao. 2015. A randomized path routing algorithm for decentralized route allocation in transportation networks. In ACM SIGSPATIAL IWCTS. 15--20.  Uyen TV Nguyen Shanika Karunasekera Lars Kulik Egemen Tanin Rui Zhang Haolan Zhang Hairuo Xie and Kotagiri Ramamohanarao. 2015. A randomized path routing algorithm for decentralized route allocation in transportation networks. In ACM SIGSPATIAL IWCTS. 15--20.","DOI":"10.1145\/2834882.2834886"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCOSS.2012.29"},{"volume-title":"Solving time-dependent shortest path problems in a database context","author":"Sperb R Campi","key":"e_1_3_2_1_27_1","unstructured":"R Campi Sperb . 2010. Solving time-dependent shortest path problems in a database context . University of Twente . R Campi Sperb. 2010. Solving time-dependent shortest path problems in a database context. University of Twente."},{"key":"e_1_3_2_1_28_1","volume-title":"Retrieved","author":"New York","year":"2015","unstructured":"New York City TLC. 2015 . TLC Trip Record Data . Retrieved January 15, 2019 from https:\/\/www1.nyc.gov\/site\/tlc\/about\/tlc-trip-record-data.page New York City TLC. 2015. TLC Trip Record Data. Retrieved January 15, 2019 from https:\/\/www1.nyc.gov\/site\/tlc\/about\/tlc-trip-record-data.page"},{"key":"e_1_3_2_1_29_1","volume-title":"TRB Annual Meeting.","author":"Wang Haizhong","year":"2009","unstructured":"Haizhong Wang , Jia Li , Qian-Yong Chen , and Daiheng Ni . 2009 . Speed-Density Relationship: From Deterministic to Stochastic . In TRB Annual Meeting. Haizhong Wang, Jia Li, Qian-Yong Chen, and Daiheng Ni. 2009. Speed-Density Relationship: From Deterministic to Stochastic. In TRB Annual Meeting."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342265"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1680\/ipeds.1952.11259"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.65"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCID.2012.260"}],"event":{"name":"SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Beijing China","acronym":"SIGSPATIAL '21"},"container-title":["Proceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486629.3490691","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3486629.3490691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:05Z","timestamp":1750191125000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486629.3490691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":33,"alternative-id":["10.1145\/3486629.3490691","10.1145\/3486629"],"URL":"https:\/\/doi.org\/10.1145\/3486629.3490691","relation":{},"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"2021-11-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}