Representative dissimilar path queries: accommodating human movement dynamics in road networks

IF 1.8 Q2 GEOGRAPHY
T. Hashem, M. Duckham, Mahathir Monjur, F. Islam
{"title":"Representative dissimilar path queries: accommodating human movement dynamics in road networks","authors":"T. Hashem, M. Duckham, Mahathir Monjur, F. Islam","doi":"10.5311/josis.2023.26.221","DOIUrl":null,"url":null,"abstract":"We introduce a representative dissimilar path (RDP) query, a novel type of path query in road networks. The k representative paths (RPs) between a source and a destination locations have k smallest costs for a feature (e.g., length, number of road intersections, or straightness). Given x features and k, an RDP query returns a set of paths for a source-destination pair such that the path set includes at least one of the k RPs for every feature, and the path set's similarity score is minimized. We formulate a novel measure to quantify the similarity of a set of paths. Considering different road features and incorporating the novel similarity measure in the computation of RDPs allow us to accommodate the human movement dynamics between two locations in an effective way. Finding the RDPs is a computational challenge because an RDP query requires computing the RPs for multiple features and then finding the RDPs from an exponential number of path combinations. We develop an efficient solution to answer RDP queries. The underlying ideas behind the efficiency of our algorithms are the refinement of the search space, finding the RPs for multiple features with a single search, and exploiting both the lower and upper bounds of the path set's similarity score while identifying the RDPs. We show the efficacy of the RDP query and the efficiency of our solution to answer the RDP query in extensive experiments using real datasets.","PeriodicalId":45389,"journal":{"name":"Journal of Spatial Information Science","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Spatial Information Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5311/josis.2023.26.221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"GEOGRAPHY","Score":null,"Total":0}
引用次数: 1

Abstract

We introduce a representative dissimilar path (RDP) query, a novel type of path query in road networks. The k representative paths (RPs) between a source and a destination locations have k smallest costs for a feature (e.g., length, number of road intersections, or straightness). Given x features and k, an RDP query returns a set of paths for a source-destination pair such that the path set includes at least one of the k RPs for every feature, and the path set's similarity score is minimized. We formulate a novel measure to quantify the similarity of a set of paths. Considering different road features and incorporating the novel similarity measure in the computation of RDPs allow us to accommodate the human movement dynamics between two locations in an effective way. Finding the RDPs is a computational challenge because an RDP query requires computing the RPs for multiple features and then finding the RDPs from an exponential number of path combinations. We develop an efficient solution to answer RDP queries. The underlying ideas behind the efficiency of our algorithms are the refinement of the search space, finding the RPs for multiple features with a single search, and exploiting both the lower and upper bounds of the path set's similarity score while identifying the RDPs. We show the efficacy of the RDP query and the efficiency of our solution to answer the RDP query in extensive experiments using real datasets.
代表性的不同路径查询:在道路网络中适应人类运动动态
我们介绍了一种具有代表性的不同路径(RDP)查询,这是道路网络中的一种新型路径查询。源位置和目的地位置之间的k个代表性路径(RP)对于一个特征具有k个最小成本(例如,长度、道路交叉口的数量或直线度)。给定x个特征和k,RDP查询返回源-目的地对的一组路径,使得该路径集包括每个特征的k个RP中的至少一个,并且该路径集的相似性得分被最小化。我们提出了一种新的度量方法来量化一组路径的相似性。考虑不同的道路特征,并在RDP的计算中加入新的相似性度量,使我们能够有效地适应两个位置之间的人类运动动态。查找RDP是一项计算挑战,因为RDP查询需要计算多个功能的RP,然后从指数数量的路径组合中查找RDP。我们开发了一个有效的解决方案来回答RDP查询。我们算法效率背后的基本思想是优化搜索空间,用一次搜索找到多个特征的RP,并在识别RDP时利用路径集相似性得分的下限和上限。在使用真实数据集进行的大量实验中,我们展示了RDP查询的有效性以及我们的解决方案对RDP查询进行回答的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.10
自引率
0.00%
发文量
5
审稿时长
9 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信