{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:59:21Z","timestamp":1753887561691,"version":"3.41.2"},"reference-count":28,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"vor","delay-in-days":134,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602102","61872069"],"award-info":[{"award-number":["61602102","61872069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>In recent years, research on location\u2010based services has received a lot of interest, in both industry and academic aspects, due to a wide range of potential applications. Among them, one of the active topic areas is the route planning on a point\u2010of\u2010interest (POI) network. We study the top\u2010k optimal routes querying on large, general graphs where the edge weights may not satisfy the triangle inequality. The query strives to find the top\u2010k optimal routes from a given source, which must visit a number of vertices with all the services that the user needs. Existing POI query methods mainly focus on the textual similarities and ignore the semantic understanding of keywords in spatial objects and queries. To address this problem, this paper studies the semantic similarity of POI keyword searching in the route. Another problem is that most of the previous studies consider that a POI belongs to a category, and they do not consider that a POI may provide various kinds of services even in the same category. So, we propose a novel top\u2010k optimal route planning algorithm based on semantic perception (KOR\u2010SP). In KOR\u2010SP, we define a dominance relationship between two partially explored routes which leads to a smaller searching space and consider the semantic similarity of keywords and the number of single POI\u2019s services. We use an efficient label indexing technique for the shortest path queries to further improve efficiency. Finally, we perform an extensive experimental evaluation on multiple real\u2010world graphs to demonstrate that the proposed methods deliver excellent performance.<\/jats:p>","DOI":"10.1155\/2019\/4047894","type":"journal-article","created":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T23:31:10Z","timestamp":1557963070000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Semantic\u2010Aware Top\u2010k Multirequest Optimal Route"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1533-1051","authenticated-orcid":false,"given":"Shuang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yingchun","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yinzhe","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hezhi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qiaoqiao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Tiemin","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Shengnan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Siyuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Anliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2019,5,15]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"crossref","unstructured":"FangS. H. LuE. H. andTsengV. S. Trip recommendation with multiple user constraints by integrating point-of-interests and travel packages Proceedings of the 2014 15th IEEE International Conference on Mobile Data Management (MDM) 2014 33\u201342 https:\/\/doi.org\/10.1109\/MDM.2014.10.","DOI":"10.1109\/MDM.2014.10"},{"key":"e_1_2_10_2_2","doi-asserted-by":"crossref","unstructured":"LuE. H. LinC. andTsengV. S. Trip-Mine: an efficient trip planning approach with travel time constraints Proceedings of the 2011 12th IEEE International Conference on Mobile Data Management (MDM) June 2011 Lulea Sweden 152\u2013161 https:\/\/doi.org\/10.1109\/MDM.2011.13.","DOI":"10.1109\/MDM.2011.13"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-015-0352-2"},{"key":"e_1_2_10_4_2","doi-asserted-by":"crossref","unstructured":"LiF. ChengD. HadjieleftheriouM. KolliosG. andTengS.-H. On trip planning queries in spatial databases Proceedings of the 9th International Symposium on Spatial and Temporal Databases SSTD 2005 August 2005 Brazil 273\u2013290 2-s2.0-26444466035.","DOI":"10.1007\/11535331_16"},{"key":"e_1_2_10_5_2","doi-asserted-by":"crossref","unstructured":"EisnerJ.andFunkeS. Sequenced route queries: getting things done on the way back home Proceedings of the 20th ACM Sigspatial International Conference on Advances in Geographic Information Systems 2012 USA 502\u2013505 2-s2.0-84872820839.","DOI":"10.1145\/2424321.2424400"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32600-4_36"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0038-6"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"LiangH.andWangK. Top-k route search through submodularity modeling of recurrent POI features Proceedings of the 41st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval SIGIR 2018 July 2018 USA 545\u2013554 2-s2.0-85051545004.","DOI":"10.1145\/3209978.3210038"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"AkibaT. IwataY. andYoshidaY. Fast exact shortest-path distance queries on large networks by pruned landmark labeling Proceedings of the 2013 ACM SIGMOD Conference on Management of Data 2013 USA 349\u2013360 2-s2.0-84880566635.","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.117"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2523068"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.65"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/tssc.1968.300136"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90008-6"},{"key":"e_1_2_10_18_2","doi-asserted-by":"crossref","unstructured":"LiF. ChengD. HadjieleftheriouM. KolliosG. andTengS. On trip planning queries in spatial databases 31 Proceedings of the International Symposium on Spatial and Temporal Databases 2005 Boston MA USA no. no.1 Springer 273\u2013290 Lecture Notes in Computer Science https:\/\/doi.org\/10.1007\/11535331_16.","DOI":"10.1007\/11535331_16"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01699094"},{"key":"e_1_2_10_20_2","doi-asserted-by":"crossref","unstructured":"AhmadiE.andNascimentoM. A. A mixed breadth-depth first search strategy for sequenced group trip planning queries Proceedings of the 16th IEEE International Conference on Mobile Data Management 2015 USA 24\u201333 2-s2.0-84958225343.","DOI":"10.1109\/MDM.2015.49"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00058"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/8503962"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2542804"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1162\/jmlr.2003.3.4-5.993"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2996593"},{"key":"e_1_2_10_26_2","unstructured":"ZengY. ChenX. CaoX. QinS. CavazzaM. andXiangY. Optimal route search with the coverage of users\u2032 preferences Proceedings of the 24th International Joint Conference on Artificial Intelligence IJCAI 2015 July 2015 Argentina 2118\u20132124 2-s2.0-84949764171."},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350234"},{"key":"e_1_2_10_28_2","doi-asserted-by":"crossref","unstructured":"LimK. H. ChanJ. KarunasekeraS. andLeckieC. Personalized itinerary recommendation with queuing time awareness Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval SIGIR 2017 August 2017 Japan 325\u2013334 2-s2.0-85029393330.","DOI":"10.1145\/3077136.3080778"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/4047894.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/4047894.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/4047894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T12:28:13Z","timestamp":1723033693000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/4047894"}},"subtitle":[],"editor":[{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/4047894"],"URL":"https:\/\/doi.org\/10.1155\/2019\/4047894","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2019-01-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-05-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4047894"}}