{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:15:00Z","timestamp":1740132900558,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472453","U1401256"],"award-info":[{"award-number":["61472453","U1401256"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Foundation of Science and Technology Plan Project in Guangdong Province","award":["2012A010701013"],"award-info":[{"award-number":["2012A010701013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Intell. Transport. Syst."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/tits.2015.2491269","type":"journal-article","created":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T14:53:30Z","timestamp":1446648810000},"page":"1666-1677","source":"Crossref","is-referenced-by-count":7,"title":["TORD Problem and Its Solution Based on Big Trajectories Data"],"prefix":"10.1109","volume":"17","author":[{"given":"Mengting","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Yin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.149"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.42"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247546"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453972"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.230"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835942"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920934"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807319"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526816"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544888"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-013-0184-0"},{"journal-title":"Etude Comparative de la Distribution Florale dans Une Portion des Alpes et du Jura","year":"1901","author":"jaccard","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.36"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350234"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0038-6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_16"},{"key":"ref2","first-page":"43","article-title":"The record balancing problem—A dynamic programming solution of a generalized traveling salesman problem","volume":"b2","author":"henry-labordere","year":"1969","journal-title":"Rev Francaise dAut Inf Rech Oper"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463448"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"ref20","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"srivastava","year":"1969","journal-title":"Canadian Oper Res Soc J"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220305"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190602"},{"key":"ref24","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"0","journal-title":"Proc SIGKDD"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10107-008-0234-9","article-title":"The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm","volume":"121","author":"irina","year":"2010","journal-title":"Math Programm"},{"key":"ref26","first-page":"853","article-title":"On map-matching vehicle tracking data","author":"brakatsoulas","year":"0","journal-title":"Proc VLDB"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3138\/FM57-6770-U75U-7727"}],"container-title":["IEEE Transactions on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6979\/7479588\/07317782.pdf?arnumber=7317782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:02Z","timestamp":1641987962000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7317782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":28,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tits.2015.2491269","relation":{},"ISSN":["1524-9050","1558-0016"],"issn-type":[{"type":"print","value":"1524-9050"},{"type":"electronic","value":"1558-0016"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}