{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:13:37Z","timestamp":1778757217367,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1145\/3557915.3560992","type":"proceedings-article","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:11:25Z","timestamp":1669162285000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Tour4Me"],"prefix":"10.1145","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mart","family":"Hagedoorn","sequence":"additional","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangping","family":"Li","sequence":"additional","affiliation":[{"name":"TU Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. 36th ACM Symposium on Theory of Computing, 166--174","author":"Bansal N.","unstructured":"N. Bansal, A. Blum, S. Chawla, and A. Meyerson. 2004. Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In Proc. 36th ACM Symposium on Theory of Computing, 166--174."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645464"},{"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.1145\/2229163.2229167"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"A. Gemsa T. Pajor D. Wagner and T. Z\u00fcndorf. 2013. Efficient computation of jogging routes. In Lecture Notes in Computer Science. Vol. 7933. (June 2013) 272--283.","DOI":"10.1007\/978-3-642-38527-8_25"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. 23rd SIGSPATIAL Internat. Conf. Advances in Geographic Information Systems, 1--10","author":"Lu Y.","unstructured":"Y. Lu and C. Shahabi. 2015. An arc orienteering algorithm to find the most scenic path on a large-scale road network. In Proc. 23rd SIGSPATIAL Internat. Conf. Advances in Geographic Information Systems, 1--10."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"P. Stroobant P. Audenaert D. Colle and M. Pickavet. 2018. Generating constrained length personalized bicycle tours. 4OR 16 4 411--439.","DOI":"10.1007\/s10288-018-0371-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"C. Verbeeck P. Vansteenwegen and E. Aghezzaf. 2014. An extension of the arc orienteering problem and its application to cycle trip planning. Transportation research part E 68 64--78.","DOI":"10.1016\/j.tre.2014.05.006"}],"event":{"name":"SIGSPATIAL '22: The 30th International Conference on Advances in Geographic Information Systems","location":"Seattle Washington","acronym":"SIGSPATIAL '22","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 30th International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3557915.3560992","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3557915.3560992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:26Z","timestamp":1750182566000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3557915.3560992"}},"subtitle":["a framework for customized tour planning algorithms"],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":8,"alternative-id":["10.1145\/3557915.3560992","10.1145\/3557915"],"URL":"https:\/\/doi.org\/10.1145\/3557915.3560992","relation":{},"subject":[],"published":{"date-parts":[[2022,11]]},"assertion":[{"value":"2022-11-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}