{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T02:59:06Z","timestamp":1776394746378,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T00:00:00Z","timestamp":1566172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007917","name":"U.S. Department of Agriculture","doi-asserted-by":"publisher","award":["2017-51181-27222"],"award-info":[{"award-number":["2017-51181-27222"]}],"id":[{"id":"10.13039\/100007917","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","award":["HM1582-08-1-0017, HM0210-13-1-0005"],"award-info":[{"award-number":["HM1582-08-1-0017, HM0210-13-1-0005"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006133","name":"Advanced Research Projects Agency - Energy","doi-asserted-by":"publisher","award":["DE-AR000079"],"award-info":[{"award-number":["DE-AR000079"]}],"id":[{"id":"10.13039\/100006133","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["UL1 TR002494, KL2 TR002492, TL1 TR00249"],"award-info":[{"award-number":["UL1 TR002494, KL2 TR002492, TL1 TR00249"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1541876, 1029711 , IIS-1320580 , IIS-0940818, IIS-121816"],"award-info":[{"award-number":["1541876, 1029711 , IIS-1320580 , IIS-0940818, IIS-121816"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,19]]},"DOI":"10.1145\/3340964.3340971","type":"proceedings-article","created":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T19:51:28Z","timestamp":1565985088000},"page":"61-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Trajectory-aware Lowest-cost Path Selection"],"prefix":"10.1145","author":[{"given":"Yan","family":"Li","sequence":"first","affiliation":[{"name":"Dept. of Computer Science & Eng, University of Minnesota - Twin Cities, Minneapolis, MN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratik","family":"Kotwal","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science & Eng, University of Minnesota - Twin Cities, Minneapolis, MN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengyue","family":"Wang","sequence":"additional","affiliation":[{"name":"Dept. of Mechanical Engineering, University of Minnesota - Twin Cities, Minneapolis, MN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science & Eng, University of Minnesota - Twin Cities, Minneapolis, MN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Northrop","sequence":"additional","affiliation":[{"name":"Dept. of Mechanical Engineering, University of Minnesota - Twin Cities, Minneapolis, Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.02.008"},{"key":"e_1_3_2_1_2_1","volume-title":"KI 2010: Advances in Artificial Intelligence (Lecture Notes in Computer Science)","author":"Artmeier Andreas","unstructured":"Andreas Artmeier , Julian Haselmayr , Martin Leucker , and Martin Sachenbacher . 2010. The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles . In KI 2010: Advances in Artificial Intelligence (Lecture Notes in Computer Science) . Springer , Berlin, Heidelberg , 309--316. Andreas Artmeier, Julian Haselmayr, Martin Leucker, and Martin Sachenbacher. 2010. The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles. In KI 2010: Advances in Artificial Intelligence (Lecture Notes in Computer Science). Springer, Berlin, Heidelberg, 309--316."},{"key":"e_1_3_2_1_3_1","volume-title":"Gutin","author":"Bang-Jensen J\u00c3\u00ffrgen","year":"2008","unstructured":"J\u00c3\u00ffrgen Bang-Jensen and Gregory Z . Gutin . 2008 . Digraphs : Theory, Algorithms and Applications. Springer . J\u00c3\u00ffrgen Bang-Jensen and Gregory Z. Gutin. 2008. Digraphs: Theory, Algorithms and Applications. Springer."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274927"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2013.2270282"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2017.08.003"},{"key":"e_1_3_2_1_7_1","volume-title":"2015 IEEE 31st International Conference on Data Engineering. 543--554","author":"Dai J.","unstructured":"J. Dai , B. Yang , C. Guo , and Z. Ding . 2015. Personalized route recommendation using big trajectory data . In 2015 IEEE 31st International Conference on Data Engineering. 543--554 . J. Dai, B. Yang, C. Guo, and Z. Ding. 2015. Personalized route recommendation using big trajectory data. In 2015 IEEE 31st International Conference on Data Engineering. 543--554."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.02.007"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.11.011"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.11.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2900423.2900599"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2011.07.058"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2426701"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274974"},{"key":"e_1_3_2_1_17_1","volume-title":"Eco-Routing based on a Data Driven Fuel Consumption Model. arXiv:1801.08602 {stat} (Jan","author":"Huang Xianan","year":"2018","unstructured":"Xianan Huang and Huei Peng . 2018. Eco-Routing based on a Data Driven Fuel Consumption Model. arXiv:1801.08602 {stat} (Jan . 2018 ). arXiv: 1801.08602. Xianan Huang and Huei Peng. 2018. Eco-Routing based on a Data Driven Fuel Consumption Model. arXiv:1801.08602 {stat} (Jan. 2018). arXiv: 1801.08602."},{"key":"e_1_3_2_1_18_1","unstructured":"Phil LeBeau. 2019. Traffic jams cost the US an estimated $87 billion in lost productivity. https:\/\/www.cnbc.com\/2019\/02\/11\/americas-87-billion-traffic-jam-ranks-boston-and-dc-as-worst-in-us.html  Phil LeBeau. 2019. Traffic jams cost the US an estimated $87 billion in lost productivity. https:\/\/www.cnbc.com\/2019\/02\/11\/americas-87-billion-traffic-jam-ranks-boston-and-dc-as-worst-in-us.html"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220033"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274933"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465287"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653818"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631775.2631799"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_25_1","unstructured":"U.S. Energy Information Administration. 2017. Total U.S. energy expenditures in 2015 were the lowest in more than a decade. https:\/\/www.eia.gov\/todayinenergy\/detail.php?id=32432  U.S. Energy Information Administration. 2017. Total U.S. energy expenditures in 2015 were the lowest in more than a decade. https:\/\/www.eia.gov\/todayinenergy\/detail.php?id=32432"},{"key":"e_1_3_2_1_26_1","volume-title":"Estimating Travel Time Based on Deep Neural Networks. In Thirty-Second AAAI Conference on Artificial Intelligence. https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/16657","author":"Wang Dong","year":"2018","unstructured":"Dong Wang , Junbo Zhang , Wei Cao , Jian Li , and Yu Zheng . 2018 . When Will You Arrive? Estimating Travel Time Based on Deep Neural Networks. In Thirty-Second AAAI Conference on Artificial Intelligence. https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/16657 Dong Wang, Junbo Zhang, Wei Cao, Jian Li, and Yu Zheng. 2018. When Will You Arrive? Estimating Travel Time Based on Deep Neural Networks. In Thirty-Second AAAI Conference on Artificial Intelligence. https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/16657"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0491-4"},{"key":"e_1_3_2_1_28_1","volume-title":"2017 IEEE Intelligent Vehicles Symposium (IV). 1242--1248","author":"Zhu L.","unstructured":"L. Zhu , J. Holden , E. Wood , and J. Gonder . 2017. Green routing fuel saving opportunity assessment: A case study using large-scale real-world travel data . In 2017 IEEE Intelligent Vehicles Symposium (IV). 1242--1248 . L. Zhu, J. Holden, E. Wood, and J. Gonder. 2017. Green routing fuel saving opportunity assessment: A case study using large-scale real-world travel data. In 2017 IEEE Intelligent Vehicles Symposium (IV). 1242--1248."}],"event":{"name":"SSTD '19: 16th International Symposium on Spatial and Temporal Databases","location":"Vienna Austria","acronym":"SSTD '19","sponsor":["TU Wien TU Wien"]},"container-title":["Proceedings of the 16th International Symposium on Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340964.3340971","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340964.3340971","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340964.3340971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:32Z","timestamp":1750202012000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340964.3340971"}},"subtitle":["A Summary of Results"],"short-title":[],"issued":{"date-parts":[[2019,8,19]]},"references-count":28,"alternative-id":["10.1145\/3340964.3340971","10.1145\/3340964"],"URL":"https:\/\/doi.org\/10.1145\/3340964.3340971","relation":{},"subject":[],"published":{"date-parts":[[2019,8,19]]},"assertion":[{"value":"2019-08-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}