{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T10:16:31Z","timestamp":1790676991263,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T00:00:00Z","timestamp":1509926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF grants","award":["IIS-1320149 and CNS-1461963"],"award-info":[{"award-number":["IIS-1320149 and CNS-1461963"]}]},{"name":"DAAD Germany","award":["PPP, project ID: 57052426"],"award-info":[{"award-number":["PPP, project ID: 57052426"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11,6]]},"DOI":"10.1145\/3132847.3132874","type":"proceedings-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T13:30:29Z","timestamp":1509975029000},"page":"487-496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Scenic Routes Now"],"prefix":"10.1145","author":[{"given":"Ying","family":"Lu","sequence":"first","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregor","family":"Josse","sequence":"additional","affiliation":[{"name":"LMU Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tobias","family":"Emrich","sequence":"additional","affiliation":[{"name":"LMU Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugur","family":"Demiryurek","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cyrus","family":"Shahabi","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Schubert","sequence":"additional","affiliation":[{"name":"LMU Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of ICDE. 531 -- 542","author":"Aljubayrin S.","unstructured":"S. Aljubayrin , J. Qi , C.S. Jensen , R. Zhang , Z. He , and Z. Wen . 2015. The safest path via safe zones . In Proc. of ICDE. 531 -- 542 . S. Aljubayrin, J. Qi, C.S. Jensen, R. Zhang, Z. He, and Z. Wen. 2015. The safest path via safe zones. In Proc. of ICDE. 531 -- 542."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.05.005"},{"key":"e_1_3_2_1_3_1","volume-title":"Arc Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization","author":"Archetti C.","year":"2013","unstructured":"C. Archetti and M G. Speranza . 2013 . Arc routing problems with profits. Arc Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization (2013), 257--284. C. Archetti and M G. Speranza. 2013. Arc routing problems with profits. Arc Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization (2013), 257--284."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of Meet. on Algo. Eng. & Exp. Society for Industrial and Applied Mathematics","author":"Batz G. Veit","unstructured":"G. Veit Batz , Daniel D., Peter S., and C. Vetter . 2009. Time-dependent Contraction Hierarchies . In Proc. of Meet. on Algo. Eng. & Exp. Society for Industrial and Applied Mathematics , Philadelphia, PA, USA, 97--105. G. Veit Batz, Daniel D., Peter S., and C. Vetter. 2009. Time-dependent Contraction Hierarchies. In Proc. of Meet. on Algo. Eng. & Exp. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 97--105."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00035-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463448"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733047"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00323-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Symp. on Spatial and Temporal Databases. 92--111","author":"Demiryurek U.","unstructured":"U. Demiryurek , F. Banaei-Kashani , C. Shahabi , and A. Ranganathan . 2011. Online computation of fastest path in time-dependent spatial networks Intl . Symp. on Spatial and Temporal Databases. 92--111 . U. Demiryurek, F. Banaei-Kashani, C. Shahabi, and A. Ranganathan. 2011. Online computation of fastest path in time-dependent spatial networks Intl. Symp. on Spatial and Temporal Databases. 92--111."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869865"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1040.0106"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0079"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"A. Garcia M. T. Linaza O. Arbelaitz and P. Vansteenwegen. 2009. Intelligent routing system for a personalised electronic tourist guide. Info. and Comm. Tech. in Tourism (2009) 185--197.  A. Garcia M. T. Linaza O. Arbelaitz and P. Vansteenwegen. 2009. Intelligent routing system for a personalised electronic tourist guide. Info. and Comm. Tech. in Tourism (2009) 185--197.","DOI":"10.1007\/978-3-211-93971-0_16"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04126-1_13"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.10.003"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00289-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"B. L Golden L. Levy and R. Vohra. 1987. The orienteering problem. Naval research logistics Vol. 34 3 (1987) 307--318.  B. L Golden L. Levy and R. Vohra. 1987. The orienteering problem. Naval research logistics Vol. 34 3 (1987) 307--318.","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D"},{"key":"e_1_3_2_1_20_1","volume-title":"Orienteering Problem: A survey of recent variants, solution approaches and applications. EJOR","author":"Gunawan A.","year":"2016","unstructured":"A. Gunawan , H.-C. Lau , and P. Vansteenwegen . 2016 . Orienteering Problem: A survey of recent variants, solution approaches and applications. EJOR (2016). A. Gunawan, H.-C. Lau, and P. Vansteenwegen. 2016. Orienteering Problem: A survey of recent variants, solution approaches and applications. EJOR (2016)."},{"key":"e_1_3_2_1_21_1","unstructured":"A. Gunawan Z. Yuan and H. C. Lau. 2014. A Mathematical Model and Metaheuristics for Time Dependent Orienteering Problem Proc. of Practice and Theory of Automated Timetabling. 202--217.  A. Gunawan Z. Yuan and H. C. Lau. 2014. A Mathematical Model and Metaheuristics for Time Dependent Orienteering Problem Proc. of Practice and Theory of Automated Timetabling. 202--217."},{"key":"e_1_3_2_1_22_1","volume-title":"Stankovic","author":"Hendawi Abdeltawab M.","year":"2017","unstructured":"Abdeltawab M. Hendawi , Aqeel Rustum , Amr A. Ahmadain , David Hazel , Ankur Teredesai , Dev Oliver , Mohamed Ali , and John A . Stankovic . 2017 . Smart Personalized Routing For Smart Cities. In IEEE ICDE. Abdeltawab M. Hendawi, Aqeel Rustum, Amr A. Ahmadain, David Hazel, Ankur Teredesai, Dev Oliver, Mohamed Ali, and John A. Stankovic. 2017. Smart Personalized Routing For Smart Cities. In IEEE ICDE."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662084"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2346496.2346506"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424346"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90100-Q"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653831"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820835"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2557642.2563673"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631775.2631799"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(91)90086-7"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0038-6"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"G. Skoumas K. Arthur S. G. Joss\u00e9 M. Schubert M. A. Nascimento A. Z\u00fcfle M.s Renz and D. Pfoser. 2015. Knowledge-Enriched Route Computation. In Advances in Spatial and Temporal Databases SSTD. 157--176.  G. Skoumas K. Arthur S. G. Joss\u00e9 M. Schubert M. A. Nascimento A. Z\u00fcfle M.s Renz and D. Pfoser. 2015. Knowledge-Enriched Route Computation. In Advances in Spatial and Temporal Databases SSTD. 157--176.","DOI":"10.1007\/978-3-319-22363-6_9"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2010.05.001"},{"key":"e_1_3_2_1_35_1","first-page":"1","article-title":"A genetic algorithm with an adaptive penalty function for the orienteering problem","volume":"4","author":"Tasgetiren M F.","year":"2001","unstructured":"M F. Tasgetiren . 2001 . A genetic algorithm with an adaptive penalty function for the orienteering problem . JESR , Vol. 4 , 2 (2001), 1 -- 26 . M F. Tasgetiren. 2001. A genetic algorithm with an adaptive penalty function for the orienteering problem. JESR, Vol. 4, 2 (2001), 1--26.","journal-title":"JESR"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1984.162"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.11.038"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2014.05.006"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0378-1"}],"event":{"name":"CIKM '17: ACM Conference on Information and Knowledge Management","location":"Singapore Singapore","acronym":"CIKM '17","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 2017 ACM on Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3132874","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132847.3132874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:24Z","timestamp":1750212804000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3132874"}},"subtitle":["Efficiently Solving the Time-Dependent Arc Orienteering Problem"],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":39,"alternative-id":["10.1145\/3132847.3132874","10.1145\/3132847"],"URL":"https:\/\/doi.org\/10.1145\/3132847.3132874","relation":{},"subject":[],"published":{"date-parts":[[2017,11,6]]},"assertion":[{"value":"2017-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}