{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T19:03:36Z","timestamp":1777748616799,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s41019-016-0030-0","type":"journal-article","created":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T14:52:54Z","timestamp":1486219974000},"page":"71-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Investigating TSP Heuristics for Location-Based Services"],"prefix":"10.1007","volume":"2","author":[{"given":"Weihuang","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,4]]},"reference":[{"issue":"5","key":"30_CR1","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S (1998) Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J ACM 45(5):753\u2013782","journal-title":"J ACM"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. In: Mathematical proceedings of the Cambridge philosophical society. Cambridge University Press, Cambridge, vol\u00a055, pp 299\u2013327","DOI":"10.1017\/S0305004100034095"},{"issue":"3","key":"30_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore M, Nemhauser GL (1968) The traveling salesman problem: a survey. Oper Res 16(3):538\u2013558","journal-title":"Oper Res"},{"issue":"9","key":"30_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"issue":"4","key":"30_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JL Bentley","year":"1992","unstructured":"Bentley JL (1992) Fast algorithms for geometric traveling salesman problems. INFORMS J Comput 4(4):387\u2013411","journal-title":"INFORMS J Comput"},{"issue":"11","key":"30_CR6","first-page":"1136","volume":"5","author":"X Cao","year":"2012","unstructured":"Cao X, Chen L, Cong G, Xiao X (2012) Keyword-aware optimal route search. PVLDB 5(11):1136\u20131147","journal-title":"PVLDB"},{"issue":"1","key":"30_CR7","first-page":"1009","volume":"3","author":"X Cao","year":"2010","unstructured":"Cao X, Cong G, Jensen CS (2010) Mining significant semantic locations from GPS data. PVLDB 3(1):1009\u20131020","journal-title":"PVLDB"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X (2011) Discovering popular routes from trajectories. In: ICDE, pp 900\u2013911","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X, Zheng Y, Xie X (2010) Searching trajectories by locations: an efficiency study. In: SIGMOD, pp 255\u2013266","DOI":"10.1145\/1807167.1807197"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: SIGKDD, pp 1082\u20131090","DOI":"10.1145\/2020408.2020579"},{"key":"30_CR11","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, DTIC Document"},{"issue":"1","key":"30_CR12","first-page":"337","volume":"2","author":"G Cong","year":"2009","unstructured":"Cong G, Jensen CS, Wu D (2009) Efficient retrieval of the top-k most relevant spatial web objects. PVLDB 2(1):337\u2013348","journal-title":"PVLDB"},{"key":"30_CR13","volume-title":"Statistics for spatial data","author":"N Cressie","year":"2015","unstructured":"Cressie N (2015) Statistics for spatial data. Wiley, New York"},{"issue":"1","key":"30_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood MM (1956) The traveling-salesman problem. Oper Res 4(1):61\u201375","journal-title":"Oper Res"},{"issue":"7196","key":"30_CR15","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1038\/nature06958","volume":"453","author":"MC Gonzalez","year":"2008","unstructured":"Gonzalez MC, Hidalgo CA, Barabasi A-L (2008) Understanding individual human mobility patterns. Nature 453(7196):779\u2013782","journal-title":"Nature"},{"issue":"4","key":"30_CR16","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inf Process Lett 1(4):132\u2013133","journal-title":"Inf Process Lett"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Guo L, Zhang D, Li G, Tan K, Bao Z (2015) Location-aware pub\/sub system: When continuous moving queries meet dynamic event streams. In: SIGMOD, pp 843\u2013857","DOI":"10.1145\/2723372.2746481"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Guo T, Cao X, Cong G (2015) Efficient algorithms for answering the m-closest keywords query. In: SIGMOD, pp 405\u2013418","DOI":"10.1145\/2723372.2723723"},{"key":"30_CR19","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2002","unstructured":"Gutin G, Punnen AP (2002) The traveling salesman problem and its variations, vol 12. Springer Science & Business Media, Berlin"},{"key":"30_CR20","first-page":"215","volume":"1","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization 1:215\u2013310","journal-title":"Local search in combinatorial optimization"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Johnson DS, McGeoch LA (2007) Experimental analysis of heuristics for the stsp. In: The traveling salesman problem and its variations. Springer, Berlin, pp 369\u2013443","DOI":"10.1007\/0-306-48213-4_9"},{"issue":"1","key":"30_CR22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48\u201350","journal-title":"Proc Am Math Soc"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng S (2005) On trip planning queries in spatial databases. In: SSTD, pp 273\u2013290","DOI":"10.1007\/11535331_16"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Li G, Chen S, Feng J, Tan K, Li W (2014) Efficient location-aware influence maximization. In: SIGMOD, pp 87\u201398","DOI":"10.1145\/2588555.2588561"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Long C, Wong RC, Wang K, Fu AW (2013) Collective spatial keyword queries: a distance owner-driven approach. In: SIGMOD, pp 689\u2013700","DOI":"10.1145\/2463676.2465275"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Luo W, Tan H, Chen L, Ni LM (2013) Finding time period-based most frequent path in big trajectory data. In: SIGMOD, pp 713\u2013724","DOI":"10.1145\/2463676.2465287"},{"issue":"4","key":"30_CR27","doi-asserted-by":"crossref","first-page":"527","DOI":"10.3758\/BF03213088","volume":"58","author":"JN MacGregor","year":"1996","unstructured":"MacGregor JN, Ormerod T (1996) Human performance on the traveling salesman problem. Percept Psychophys 58(4):527\u2013539","journal-title":"Percept Psychophys"},{"issue":"4","key":"30_CR28","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1093\/imamat\/3.4.362","volume":"3","author":"T Nicholson","year":"1967","unstructured":"Nicholson T (1967) A sequential method for discrete optimization problems and its application to the assignment, travelling salesman, and three machine scheduling problems. IMA J Appl Math 3(4):362\u2013375","journal-title":"IMA J Appl Math"},{"issue":"4","key":"30_CR29","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1145\/76359.76361","volume":"36","author":"LK Platzman","year":"1989","unstructured":"Platzman LK, Bartholdi JJ III (1989) Spacefilling curves and the planar travelling salesman problem. J ACM (JACM) 36(4):719\u2013737","journal-title":"J ACM (JACM)"},{"issue":"4","key":"30_CR30","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) Tsplib-a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"30_CR31","doi-asserted-by":"crossref","unstructured":"Rosenkrantz DJ, Stearns RE, P. M. L. II. (1977) An analysis of several heuristics for the traveling salesman problem. SIAM J Comput 6(3):563\u2013581","DOI":"10.1137\/0206041"},{"key":"30_CR32","volume-title":"Statistical methods for spatial data analysis","author":"O Schabenberger","year":"2004","unstructured":"Schabenberger O, Gotway CA (2004) Statistical methods for spatial data analysis. CRC Press, Boca Raton"},{"issue":"4","key":"30_CR33","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00778-006-0038-6","volume":"17","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh M, Kolahdouzan MR, Shahabi C (2008) The optimal sequenced route query. VLDB J 17(4):765\u2013787","journal-title":"VLDB J"},{"issue":"4","key":"30_CR34","doi-asserted-by":"crossref","first-page":"45:1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer C (2014) Shortest-path queries in static networks. ACM Comput Surv 46(4):45:1\u201345:31","journal-title":"ACM Comput Surv"},{"key":"30_CR35","doi-asserted-by":"crossref","unstructured":"Wang S, Lin W, Yang Y, Xiao X, Zhou S (2015) Efficient route planning on public transportation networks: A labelling approach. In: SIGMOD, pp 967\u2013982","DOI":"10.1145\/2723372.2749456"},{"key":"30_CR36","doi-asserted-by":"crossref","unstructured":"Xu Z, Jacobsen H (2010) Processing proximity relations in road networks. In: SIGMOD, pp 243\u2013254","DOI":"10.1145\/1807167.1807196"},{"issue":"11","key":"30_CR37","first-page":"968","volume":"4","author":"D Yan","year":"2011","unstructured":"Yan D, Zhao Z, Ng W (2011) Efficient algorithms for finding optimal meeting point on road networks. PVLDB 4(11):968\u2013979","journal-title":"PVLDB"},{"key":"30_CR38","doi-asserted-by":"crossref","unstructured":"Zhu AD, Ma H, Xiao X, Luo S, Tang Y, Zhou S (2013) Shortest path and distance queries on road networks: towards bridging theory and practice. In: SIGMOD, pp 857\u2013868","DOI":"10.1145\/2463676.2465277"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0030-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-016-0030-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0030-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T09:47:22Z","timestamp":1498384042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-016-0030-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,4]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s41019-016-0030-0","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,4]]}}}