Dynamic Group Trip Planning Queries in Spatial Databases

Farhana Aklam, W. Osborn
{"title":"Dynamic Group Trip Planning Queries in Spatial Databases","authors":"Farhana Aklam, W. Osborn","doi":"10.1109/CCECE47787.2020.9255682","DOIUrl":null,"url":null,"abstract":"Trip planning queries are considered an integral part of Location Based Services. In this paper, we investigate Sequential Group Trip Planning Queries (SGTPQ). Given a set of starting and destination locations and an ordered sequence of Categories of Interests (COIs) for a group of users, a SGTP query returns the trip route for all users that minimizes the overall travel distance. We propose two approaches: Dynamic Group Trip Planning (DGTP) and Modified Dynamic Group Trip Planning (M-DGTP). The proposed DGTP approach enables users to plan a group trip in a more flexible manner, while the M-DGTP approach optimizes the total travel distance of the group. We compare the results of our proposed strategies with an existing strategy through experimental evaluation.","PeriodicalId":296506,"journal":{"name":"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","volume":"169 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE47787.2020.9255682","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Trip planning queries are considered an integral part of Location Based Services. In this paper, we investigate Sequential Group Trip Planning Queries (SGTPQ). Given a set of starting and destination locations and an ordered sequence of Categories of Interests (COIs) for a group of users, a SGTP query returns the trip route for all users that minimizes the overall travel distance. We propose two approaches: Dynamic Group Trip Planning (DGTP) and Modified Dynamic Group Trip Planning (M-DGTP). The proposed DGTP approach enables users to plan a group trip in a more flexible manner, while the M-DGTP approach optimizes the total travel distance of the group. We compare the results of our proposed strategies with an existing strategy through experimental evaluation.
空间数据库中的动态团体旅行计划查询
旅行计划查询被认为是基于位置的服务的一个组成部分。在本文中,我们研究了顺序群旅行计划查询(SGTPQ)。给定一组用户的一组起始和目的地位置以及兴趣类别(Categories of interest, coi)的有序序列,SGTP查询将返回所有用户的行程路线,从而使总行程距离最小化。本文提出了两种方法:动态组团旅行计划(DGTP)和改进动态组团旅行计划(M-DGTP)。建议的DGTP方法使用户能够以更灵活的方式计划团体旅行,而M-DGTP方法优化了团体的总旅行距离。我们通过实验评估比较了我们提出的策略与现有策略的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信