多重背景下的top-k路径序列查询  

According to top-k sequenced routs of the background

作　　者：冯雨 李艳红[1] 任佳宇 FENG Yu;LI Yanhong;REN Jiayu(College of Computer Science,South-Central Minzu University,Wuhan 430074,China)

机构地区：[1]中南民族大学计算机科学学院,武汉430074

出　　处：《中南民族大学学报（自然科学版）》2024年第6期835-843,共9页Journal of South-Central Minzu University(Natural Science Edition)

基　　金：湖北省自然科学基金资助项目(2017CFB135);中央高校基本科研业务费专项资金资助项目(CCNU18QN017,CZZ17003,CZY23019)。

摘　　要：随着路网信息的逐渐完善以及人们出行需求的增长,路网属性和路径查询方式正在不断地丰富,传统路网上的路径查询正在转变为时间依赖路网上的路径查询.查询需求的增加使得在某些情境中时间依赖路网上的路径查询结果并非最佳(如某些时刻部分道路禁止通行带来不同道路通行时间的差异、在极端天气情况下道路的通行时间与平时不同等).对时间依赖路网进行了拓展,在考虑时间背景的基础上,引入道路属性及天气因素,以此得到当前查询背景下的最优路径.为了有效地解决当前背景下的top-k路径序列查询问题,对候选路径建立了支配关系用来进行合理路径剪枝,使其在多条件下的时间依赖路网中能根据特殊点策略序列(例如<饭店→加油站→电影院>)得到旅行时间最短的前k条路径.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 timedependent 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.

关 键 词：时间依赖路网 路网 路径规划 路径序列查询 旅行时间 

分 类 号：O625.67[理学—有机化学] O643.3[理学—化学]