According to top-k sequenced routs of the background
With the gradual improvement of road network information and the growth of people's travel demand,road network attributes and path query methods are constantly enriched.The traditional path query on road network is changing into time-dependent path query on road network.The increase of query demand makes the path query results on the time-dependent road network not the best in some situations(for example,the prohibition of some roads at some time leads to the difference of traffic time of different roads,and the traffic time of roads is different from that at ordinary times in extreme weather conditions).The time-dependent road network is extended.On the basis of considering the time background,the road attributes and weather factors are introduced to obtain the optimal path under the current query background.In order to effectively solve the top-k path sequence query problem under the current background,a dominant relationship for the candidate paths for reasonable path pruning is established,so that they can get the first k paths with the shortest travel time according to the special point strategy sequence(such as<hotels → gas stations → cinemas>)in the time-dependent road network under multiple conditions.
time-dependent road networkroad networkpath planningsequence querytravel time
国家科技期刊平台
NSTL
万方数据
