城市环境中交通拥堵传播的检测——以上海市浮动出租车数据为例

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
A. Keler, J. Krisp, L. Ding
{"title":"城市环境中交通拥堵传播的检测——以上海市浮动出租车数据为例","authors":"A. Keler, J. Krisp, L. Ding","doi":"10.1080/17489725.2017.1420256","DOIUrl":null,"url":null,"abstract":"Abstract Traffic congestion in urban environments has severe influences on the daily life of people. Due to typical recurrent mobility patterns of commuters and transport fleets, we can detect traffic congestion events on selected hours of the day, so called rush hours. Besides the mentioned recurrent traffic congestion, there are non-recurrent events that may be caused by accidents or newly established building sites. We want to inspect this appearance using a massive Floating Taxi Data (FTD) set of Shanghai from 2007. We introduce a simple method for detecting and extracting congestion events on selected rush hours and for distinguishing between their recurrence and non-recurrence. By preselecting of similar velocity and driving direction values of the nearby situated FTD points, we provide the first part for the Shared Nearest Neighbour (SNN) clustering method, which follows with a density-based clustering. After the definition of our traffic congestion clusters, we try to connect ongoing events by querying individual taxi identifications. The detected events are then represented by polylines that connect density core points of the clusters. By comparing the shapes of congestion propagation polylines of different days, we try to classify recurrent congestion events that follow similar patterns. In the end, we reason on the reasonability of our method and mention further steps of its extension.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17489725.2017.1420256","citationCount":"7","resultStr":"{\"title\":\"Detecting traffic congestion propagation in urban environments – a case study with Floating Taxi Data (FTD) in Shanghai\",\"authors\":\"A. Keler, J. Krisp, L. Ding\",\"doi\":\"10.1080/17489725.2017.1420256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Traffic congestion in urban environments has severe influences on the daily life of people. Due to typical recurrent mobility patterns of commuters and transport fleets, we can detect traffic congestion events on selected hours of the day, so called rush hours. Besides the mentioned recurrent traffic congestion, there are non-recurrent events that may be caused by accidents or newly established building sites. We want to inspect this appearance using a massive Floating Taxi Data (FTD) set of Shanghai from 2007. We introduce a simple method for detecting and extracting congestion events on selected rush hours and for distinguishing between their recurrence and non-recurrence. By preselecting of similar velocity and driving direction values of the nearby situated FTD points, we provide the first part for the Shared Nearest Neighbour (SNN) clustering method, which follows with a density-based clustering. After the definition of our traffic congestion clusters, we try to connect ongoing events by querying individual taxi identifications. The detected events are then represented by polylines that connect density core points of the clusters. By comparing the shapes of congestion propagation polylines of different days, we try to classify recurrent congestion events that follow similar patterns. In the end, we reason on the reasonability of our method and mention further steps of its extension.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2017-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/17489725.2017.1420256\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/17489725.2017.1420256\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17489725.2017.1420256","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 7

摘要

城市环境中的交通拥堵严重影响着人们的日常生活。由于通勤者和运输车队的典型循环流动模式,我们可以在一天中的选定时间检测交通拥堵事件,即所谓的高峰时间。除了上述经常发生的交通挤塞外,还有一些非经常发生的情况,可能是由意外或新兴建的建筑地盘造成的。我们想用2007年上海的大量浮动出租车数据(FTD)来检验这种外观。我们介绍了一种简单的方法来检测和提取选定高峰时段的拥堵事件,并区分它们的复发和非复发。通过预选附近FTD点的相似速度和驱动方向值,我们为共享近邻(SNN)聚类方法提供了第一部分,然后是基于密度的聚类方法。在我们的交通拥堵集群定义之后,我们尝试通过查询个别出租车标识来连接正在进行的事件。检测到的事件然后由连接集群密度核心点的折线表示。通过比较不同日子的拥塞传播折线的形状,我们尝试对遵循相似模式的反复出现的拥塞事件进行分类。最后,对本文方法的合理性进行了论证,并提出了进一步推广的步骤。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Detecting traffic congestion propagation in urban environments – a case study with Floating Taxi Data (FTD) in Shanghai
Abstract Traffic congestion in urban environments has severe influences on the daily life of people. Due to typical recurrent mobility patterns of commuters and transport fleets, we can detect traffic congestion events on selected hours of the day, so called rush hours. Besides the mentioned recurrent traffic congestion, there are non-recurrent events that may be caused by accidents or newly established building sites. We want to inspect this appearance using a massive Floating Taxi Data (FTD) set of Shanghai from 2007. We introduce a simple method for detecting and extracting congestion events on selected rush hours and for distinguishing between their recurrence and non-recurrence. By preselecting of similar velocity and driving direction values of the nearby situated FTD points, we provide the first part for the Shared Nearest Neighbour (SNN) clustering method, which follows with a density-based clustering. After the definition of our traffic congestion clusters, we try to connect ongoing events by querying individual taxi identifications. The detected events are then represented by polylines that connect density core points of the clusters. By comparing the shapes of congestion propagation polylines of different days, we try to classify recurrent congestion events that follow similar patterns. In the end, we reason on the reasonability of our method and mention further steps of its extension.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信