Journal on Communications ›› 2023, Vol. 44 ›› Issue (9): 205-217.doi: 10.11959/j.issn.1000-436x.2023171

• Correspondences • Previous Articles    

Keyword-aware optimal route planning method for large-scale graph data

Ziyang LI1, Pengcheng CHEN1, Jiong YU1,2, Yonglin PU3, Zhenzhen HE2, Xue LI2, Shijie ZHENG1   

  1. 1 School of Software, Xinjiang University, Urumqi 830002, China
    2 School of Information Science and Engineering, Xinjiang University, Urumqi 830017, China
    3 School of Software, Nanjing University of Information Science and Technology, Nanjing 210044, China
  • Revised:2023-07-04 Online:2023-09-01 Published:2023-09-01
  • Supported by:
    The National Natural Science Foundation of China(62262064);The National Natural Science Foundation of China(62266043);The National Natural Science Foundation of China(61966035);The Key Research and Development Project in Xinjiang Uygur Autonomous Region(2022295358);The Natural Science Foundation of Xinjiang Uygur Autonomous Region(2022D01C56);Xinjiang University Doctor Postgraduate Innovation Project(XJU2022BS072)

Abstract:

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.

Key words: graph data, route planning, dynamic programming, inverted index algorithm, bidirectional parallel extension

CLC Number: 

No Suggested Reading articles found!