Affiliation:
1. The Key Laboratory of Network Computing and Security Technology of Shaanxi Province, Xi’an University of Technology, Xi’an 710048, China
2. The Key Laboratory of Industrial Automation of Shaanxi Province, Shaanxi University of Technology, Hanzhong 723001, China
Abstract
Traditional route planning methods usually plan the “fastest” or “lowest cost” travel route for users with the goal of finding the shortest path or the lowest cost, but this method cannot meet the needs of tourism users for personalized and multifunctional travel routes. Given this phenomenon, this paper proposes a personalized route planning model based on urgency. First, the model uses the visitor’s historical tourism data and public road network data to extract their preferences, POI (point of interest) relationships, edge scenic values and other information. Then, the planned route function is determined according to the urgency value, which provides users with travel routes that accommodate their interest preferences and urgency. Finally, the improved genetic algorithm based on gene replacement and gene splicing operators is used to carry out numerical experiments on the Xi’an and Wuhan road network datasets. The experimental results show that the proposed algorithm is not only capable of planning routes with different functions for diverse users but also performs personalized route planning according to their preferences.
Funder
the National Natural Science Foundation of China
the National Social Science Foundation of China
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference30 articles.
1. Multi source heterogeneous crowdsourcing data landscape travel route planning;Chen;J. Zhejiang Univ. Eng. Ed.,2016
2. TripImputor: Real-Time Imputing Taxi Trip Purpose Leveraging Multi-Sourced Urban Data;Chen;IEEE Trans. Intell. Transp. Syst.,2018
3. An Efficient Path Pruning Algorithm for Geographical Routing in Wireless Networks;Ma;IEEE Trans. Veh. Technol.,2008
4. The orienteering problem: A survey;Vansteenwegen;Eur. J. Oper. Res.,2011
5. The orienteering problem;Golden;Nav. Res. Logist.,1987
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献