Keyword-aware optimal route planning method for large-scale graph data
Focused on the problem that the planned routes cannot meet the personalized demand of different users in route planning of personalized self-driving tour, a keyword-aware optimal route planning method based on different user interests was proposed.Firstly, the road network information preprocessing...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2023-09-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023171/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539198615552000 |
|---|---|
| author | Ziyang LI Pengcheng CHEN Jiong YU Yonglin PU Zhenzhen HE Xue LI Shijie ZHENG |
| author_facet | Ziyang LI Pengcheng CHEN Jiong YU Yonglin PU Zhenzhen HE Xue LI Shijie ZHENG |
| author_sort | Ziyang LI |
| collection | DOAJ |
| description | Focused on the problem that the planned routes cannot meet the personalized demand of different users in route planning of personalized self-driving tour, a keyword-aware optimal route planning method based on different user interests was proposed.Firstly, the road network information preprocessing model was set up and the road network information query graph was built by the road network information preprocessing algorithm.Secondly, the inverted index algorithm was proposed to prune the road network information query graph according to the personalized requirements from users, which improved the execution efficiency of keyword-aware optimal route planning method and reduced the memory cost of large-scale data processing effectively.Finally, the keyword-aware optimal route planning algorithm was proposed to realize personalized recommendation according to user interest by bidirectional parallel extension.The experimental results show that the method not only realizes the route planning to meet the individual needs of users but also improves the execution efficiency of the method through pruning and bidirectional parallel extension. |
| format | Article |
| id | doaj-art-64e2743afb19467daec2935176fc70cb |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2023-09-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-64e2743afb19467daec2935176fc70cb2025-01-14T07:23:36ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2023-09-014420521759836238Keyword-aware optimal route planning method for large-scale graph dataZiyang LIPengcheng CHENJiong YUYonglin PUZhenzhen HEXue LIShijie ZHENGFocused on the problem that the planned routes cannot meet the personalized demand of different users in route planning of personalized self-driving tour, a keyword-aware optimal route planning method based on different user interests was proposed.Firstly, the road network information preprocessing model was set up and the road network information query graph was built by the road network information preprocessing algorithm.Secondly, the inverted index algorithm was proposed to prune the road network information query graph according to the personalized requirements from users, which improved the execution efficiency of keyword-aware optimal route planning method and reduced the memory cost of large-scale data processing effectively.Finally, the keyword-aware optimal route planning algorithm was proposed to realize personalized recommendation according to user interest by bidirectional parallel extension.The experimental results show that the method not only realizes the route planning to meet the individual needs of users but also improves the execution efficiency of the method through pruning and bidirectional parallel extension.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023171/graph dataroute planningdynamic programminginverted index algorithmbidirectional parallel extension |
| spellingShingle | Ziyang LI Pengcheng CHEN Jiong YU Yonglin PU Zhenzhen HE Xue LI Shijie ZHENG Keyword-aware optimal route planning method for large-scale graph data Tongxin xuebao graph data route planning dynamic programming inverted index algorithm bidirectional parallel extension |
| title | Keyword-aware optimal route planning method for large-scale graph data |
| title_full | Keyword-aware optimal route planning method for large-scale graph data |
| title_fullStr | Keyword-aware optimal route planning method for large-scale graph data |
| title_full_unstemmed | Keyword-aware optimal route planning method for large-scale graph data |
| title_short | Keyword-aware optimal route planning method for large-scale graph data |
| title_sort | keyword aware optimal route planning method for large scale graph data |
| topic | graph data route planning dynamic programming inverted index algorithm bidirectional parallel extension |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023171/ |
| work_keys_str_mv | AT ziyangli keywordawareoptimalrouteplanningmethodforlargescalegraphdata AT pengchengchen keywordawareoptimalrouteplanningmethodforlargescalegraphdata AT jiongyu keywordawareoptimalrouteplanningmethodforlargescalegraphdata AT yonglinpu keywordawareoptimalrouteplanningmethodforlargescalegraphdata AT zhenzhenhe keywordawareoptimalrouteplanningmethodforlargescalegraphdata AT xueli keywordawareoptimalrouteplanningmethodforlargescalegraphdata AT shijiezheng keywordawareoptimalrouteplanningmethodforlargescalegraphdata |