Grouping Similar Trajectories for Carpooling Purposes

Michael Cruz, Hendrik T. Macedo, Adolfo P. Guimarães
{"title":"Grouping Similar Trajectories for Carpooling Purposes","authors":"Michael Cruz, Hendrik T. Macedo, Adolfo P. Guimarães","doi":"10.1109/BRACIS.2015.36","DOIUrl":null,"url":null,"abstract":"Vehicle congestion is a serious concern in metropolitan areas. Some policies have been adopted in order to soften the problem: construction of alternative routes, encouragement for the use of bicycles, improvement on public transportation, among others. A practice that might help is carpooling. Carpooling consists in sharing private vehicle space among people with similar trajectories. Although there exist some software initiatives to facilitate the carpooling practice, none of them actually provides some key facilities such as searching for people with similar trajectories. The way in which such a trajectory is represented is also central. In the specific context of carpooling, the use of Points of Interest (POI) as a method for trajectory discretization is rather relevant. In this paper, we consider that and other assumptions to propose an innovative approach to generate trajectory clusters for carpooling purposes, based on Optics algorithm. We also propose a new similarity measure for trajectories. Two experiments have been performed in order to prove the feasibility of the approach. Furthermore, we compare our approach with K-means and Optics. Results have showed that the proposed approach has results similar for Davies-Boulding index (DBI).","PeriodicalId":416771,"journal":{"name":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2015.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

Vehicle congestion is a serious concern in metropolitan areas. Some policies have been adopted in order to soften the problem: construction of alternative routes, encouragement for the use of bicycles, improvement on public transportation, among others. A practice that might help is carpooling. Carpooling consists in sharing private vehicle space among people with similar trajectories. Although there exist some software initiatives to facilitate the carpooling practice, none of them actually provides some key facilities such as searching for people with similar trajectories. The way in which such a trajectory is represented is also central. In the specific context of carpooling, the use of Points of Interest (POI) as a method for trajectory discretization is rather relevant. In this paper, we consider that and other assumptions to propose an innovative approach to generate trajectory clusters for carpooling purposes, based on Optics algorithm. We also propose a new similarity measure for trajectories. Two experiments have been performed in order to prove the feasibility of the approach. Furthermore, we compare our approach with K-means and Optics. Results have showed that the proposed approach has results similar for Davies-Boulding index (DBI).
为拼车目的对相似轨迹进行分组
在大城市,车辆拥堵是一个严重的问题。为了缓解这一问题,已经采取了一些政策:修建替代路线,鼓励使用自行车,改善公共交通等等。拼车可能会有所帮助。拼车是指在生活轨迹相似的人之间共享私家车空间。虽然有一些软件可以促进拼车的实践,但它们都没有提供一些关键的功能,比如搜索轨迹相似的人。这种轨迹的表现方式也很重要。在拼车的具体情况下,使用兴趣点(POI)作为轨迹离散化的方法是相当相关的。在本文中,我们考虑到这一点和其他假设,提出了一种基于光学算法的创新方法来生成用于拼车目的的轨迹聚类。我们还提出了一种新的轨迹相似性度量。为了证明该方法的可行性,进行了两个实验。此外,我们将我们的方法与K-means和Optics进行了比较。结果表明,所提出的方法对davis - boulding指数(DBI)具有相似的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信