高效提取城市交通模式的新型行程聚集方法

Praveen Kumar, Partha Chakroborty, Hemant Gehlot
{"title":"高效提取城市交通模式的新型行程聚集方法","authors":"Praveen Kumar, Partha Chakroborty, Hemant Gehlot","doi":"10.1007/s11067-024-09641-3","DOIUrl":null,"url":null,"abstract":"<p>Mobility patterns in an urban area can be defined as the trip making behavior of an urban population. Traditionally, the origin-destination matrix representation of travel demand, where trip ends are agglomerated toward zone centroids that are decided a priori, has historically been used to identify trip making behavior. In this paper, different agglomeration methods are explored to extract the trip making behavior and their performances are analyzed. First, a variant of the zone-based agglomeration method is proposed, in which zones are optimally located rather than having their locations determined beforehand. Then a trip-based agglomeration method is proposed, where each trip is represented as an ordered pair of origin and destination in the form of a line segment and agglomeration of these line segments is performed. The proposed line-based agglomeration method serves a two-fold purpose, (a) the proposed trip-based agglomeration method helps in identifying the corridors carrying the majority of the flow in a single step, as opposed to trip-end based agglomeration methods where several post-processing steps may be required to identify the corridors, and (b) this method performs better than the existing trip-end based agglomeration methods in terms of the number of corridors that are required to cover the given trips. Efficient algorithms are also developed to solve the proposed trip-based agglomeration method, their performance on real-world trip datasets is tested and finally, the properties of the proposed algorithms are explored.</p>","PeriodicalId":501141,"journal":{"name":"Networks and Spatial Economics","volume":"6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Novel Trip Agglomeration Methods for Efficient Extraction of Urban Mobility Patterns\",\"authors\":\"Praveen Kumar, Partha Chakroborty, Hemant Gehlot\",\"doi\":\"10.1007/s11067-024-09641-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Mobility patterns in an urban area can be defined as the trip making behavior of an urban population. Traditionally, the origin-destination matrix representation of travel demand, where trip ends are agglomerated toward zone centroids that are decided a priori, has historically been used to identify trip making behavior. In this paper, different agglomeration methods are explored to extract the trip making behavior and their performances are analyzed. First, a variant of the zone-based agglomeration method is proposed, in which zones are optimally located rather than having their locations determined beforehand. Then a trip-based agglomeration method is proposed, where each trip is represented as an ordered pair of origin and destination in the form of a line segment and agglomeration of these line segments is performed. The proposed line-based agglomeration method serves a two-fold purpose, (a) the proposed trip-based agglomeration method helps in identifying the corridors carrying the majority of the flow in a single step, as opposed to trip-end based agglomeration methods where several post-processing steps may be required to identify the corridors, and (b) this method performs better than the existing trip-end based agglomeration methods in terms of the number of corridors that are required to cover the given trips. Efficient algorithms are also developed to solve the proposed trip-based agglomeration method, their performance on real-world trip datasets is tested and finally, the properties of the proposed algorithms are explored.</p>\",\"PeriodicalId\":501141,\"journal\":{\"name\":\"Networks and Spatial Economics\",\"volume\":\"6 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Networks and Spatial Economics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11067-024-09641-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networks and Spatial Economics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11067-024-09641-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

城市地区的流动模式可定义为城市人口的出行行为。传统上,旅行需求的出发地-目的地矩阵表示法(旅行终点向事先确定的区域中心集聚)一直被用于识别旅行行为。本文探讨了不同的集聚方法来提取出行行为,并对其性能进行了分析。首先,本文提出了一种基于分区的集聚方法的变体,在这种方法中,分区的位置是最优的,而不是事先确定的。然后,提出了一种基于行程的集聚方法,其中每个行程都以线段的形式表示为一对有序的出发地和目的地,并对这些线段进行集聚。所提出的基于线段的聚类方法有两个目的:(a) 所提出的基于行程的聚类方法有助于在一个步骤中确定承载大部分流量的走廊,而基于行程终点的聚类方法可能需要几个后处理步骤才能确定走廊;(b) 就覆盖给定行程所需的走廊数量而言,该方法比现有的基于行程终点的聚类方法性能更好。此外,还开发了高效算法来解决所提出的基于行程的集聚方法,并在实际行程数据集上测试了这些算法的性能,最后探讨了所提出算法的特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Novel Trip Agglomeration Methods for Efficient Extraction of Urban Mobility Patterns

Mobility patterns in an urban area can be defined as the trip making behavior of an urban population. Traditionally, the origin-destination matrix representation of travel demand, where trip ends are agglomerated toward zone centroids that are decided a priori, has historically been used to identify trip making behavior. In this paper, different agglomeration methods are explored to extract the trip making behavior and their performances are analyzed. First, a variant of the zone-based agglomeration method is proposed, in which zones are optimally located rather than having their locations determined beforehand. Then a trip-based agglomeration method is proposed, where each trip is represented as an ordered pair of origin and destination in the form of a line segment and agglomeration of these line segments is performed. The proposed line-based agglomeration method serves a two-fold purpose, (a) the proposed trip-based agglomeration method helps in identifying the corridors carrying the majority of the flow in a single step, as opposed to trip-end based agglomeration methods where several post-processing steps may be required to identify the corridors, and (b) this method performs better than the existing trip-end based agglomeration methods in terms of the number of corridors that are required to cover the given trips. Efficient algorithms are also developed to solve the proposed trip-based agglomeration method, their performance on real-world trip datasets is tested and finally, the properties of the proposed algorithms are explored.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Meal Delivery Routing Problem with Stochastic Meal Preparation Times and Customer Locations Dynamic Pricing Analysis under Demand-Supply Equilibrium of Autonomous-Mobility-on-Demand Services From traditional to digital servicification: Chinese services in European manufacturing Fulfillment Center Location and Network Design in Dual-Channel Retailing Node Coincidence in Metric Minimum Weighted Length Graph Embeddings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1