基于聚类算法的城市交通热点挖掘及居民出行时空需求分析——以成都市出租车轨迹数据为例
Mining Urban Traffic Hotspots and Analyzing Spatiotemporal Travel Demand of Residents Based on Clustering Algorithms—A Case Study of Taxi Trajectory Data in Chengdu
DOI: 10.12677/sa.2025.148247, PDF,    科研立项经费支持
作者: 王伟鑫:四川外国语大学国际工商管理学院,重庆;康 硕:河北工业大学经济管理学院,天津
关键词: 轨迹数据热点聚类交通拥堵居民出行时空需求Trajectory Data Hotspot Clustering Traffic Congestion Residents’ Spatiotemporal Travel Demand
摘要: 为精准感知城市交通运行状态并深度洞察居民出行规律,本文以成都市出租车GPS轨迹数据为例,提出了一套基于聚类算法的城市交通“热点路段”挖掘、量化及应用分析框架。研究首先对原始轨迹数据进行预处理,提取高质量的OD (起讫点)数据集;随后,分别采用DBSCAN与K-means算法进行交通热点路段挖掘,并通过轮廓系数、离群点率等多个指标对比验证了DBSCAN算法在识别路网形态热点上的优越性;在此基础上,构建了综合出行规模与空间密度的热度量化模型,对识别出的热点路段进行了定量评估。研究结果表明:1) 成功识别出人民南路三段等多个关键交通热点,并发现其热度与周边功能属性高度相关;2) 居民出行在工作日与休息日呈现显著不同的高峰时段特征,且工作日高峰时段的OD点在空间上与通勤规律高度吻合。本研究不仅为利用交通大数据进行精细化城市分析提供了方法论参考,也为交通资源优化配置、拥堵疏导及城市规划提供了数据驱动的决策支持。
Abstract: To accurately perceive the operational status of urban traffic and gain deep insights into residents’ travel patterns, this paper proposes a framework for mining, quantifying, and analyzing urban traffic “hotspot road segments” based on clustering algorithms, using GPS trajectory data from taxis in Chengdu as an example. The study first preprocesses the raw trajectory data to extract a high-quality OD (origin-destination) dataset. Subsequently, DBSCAN and K-means algorithms are employed to mine traffic hotspot road segments, and the superiority of the DBSCAN algorithm in identifying hotspots in road network patterns is verified through multiple indicators such as the contour coefficient and outlier rate. Based on this, a heat quantification model that integrates travel scale and spatial density is constructed to quantitatively evaluate the identified hotspot road segments. The research results show that: 1) Several key traffic hotspots, such as the third section of Renmin South Road, have been successfully identified, and their heat is highly correlated with surrounding functional attributes; 2) Residents’ travel patterns exhibit significantly different peak period characteristics on weekdays and weekends, and the OD points during peak periods on weekdays are highly spatially consistent with commuting patterns. This study not only provides a methodological reference for utilizing traffic big data for refined urban analysis but also offers data-driven decision support for optimizing traffic resource allocation, easing congestion, and urban planning.
文章引用:王伟鑫, 康硕. 基于聚类算法的城市交通热点挖掘及居民出行时空需求分析——以成都市出租车轨迹数据为例[J]. 统计学与应用, 2025, 14(8): 427-440. https://doi.org/10.12677/sa.2025.148247

参考文献

[1] Shi, Y., Lin, Y., Lim, M.K., Tseng, M., Tan, C. and Li, Y. (2022) An Intelligent Green Scheduling System for Sustainable Cold Chain Logistics. Expert Systems with Applications, 209, Article ID: 118378. [Google Scholar] [CrossRef
[2] Guo, X., Zhang, W. and Liu, B. (2022) Low-Carbon Routing for Cold-Chain Logistics Considering the Time-Dependent Effects of Traffic Congestion. Transportation Research Part D: Transport and Environment, 113, Article ID: 103502. [Google Scholar] [CrossRef
[3] 余海燕, 唐婉倩, 吴腾宇. 带硬时间窗的O2O生鲜外卖即时配送路径优化[J]. 系统管理学报, 2021, 30(3): 584-591.
[4] 李倩, 蒋丽, 梁昌勇. 基于模糊时间窗的多目标冷链配送优化[J]. 计算机工程与应用, 2021, 57(23): 255-262.
[5] 庄峻, 杨东. 面向生鲜电商的前置仓选址及订单履约决策优化研究[J]. 中国管理科学, 2024, 32(2): 188-198.
[6] 刘明, 曹杰, 章定. 数据驱动的疫情应急物流网络动态调整优化[J]. 系统工程理论与实践, 2020, 40(2): 437-448.
[7] Wang, Y., Li, Q., Guan, X., Fan, J., Xu, M. and Wang, H. (2021) Collaborative Multi-Depot Pickup and Delivery Vehicle Routing Problem with Split Loads and Time Windows. Knowledge-Based Systems, 231, Article ID: 107412. [Google Scholar] [CrossRef
[8] Zhen, L., Ma, C., Wang, K., Xiao, L. and Zhang, W. (2020) Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates. Transportation Research Part E: Logistics and Transportation Review, 135, Article ID: 101866. [Google Scholar] [CrossRef
[9] Schmidt, C.E., Silva, A.C.L., Darvish, M. and Coelho, L.C. (2023) Time-Dependent Fleet Size and Mix Multi-Depot Vehicle Routing Problem. International Journal of Production Economics, 255, Article ID: 108653. [Google Scholar] [CrossRef
[10] Fan, H.M., Zhang, Y.G., Tian, P.J., et al. (2021) Time-Dependent Multi-Depot Green Vehicle Routing Problem with Time Windows Considering Temporal-Spatial Distance. Computers & Operations Research, 129, Article ID: 105211. [Google Scholar] [CrossRef
[11] 辜勇, 袁源乙, 张列, 等. 带时间窗的多中心半开放式车辆路径问题[J]. 中国机械工程, 2020, 31(14): 1733-1740.
[12] 戴树贵, 陈文兰, 潘荫荣, 等. 多配送中心车辆路径安排问题混合蚁群算法[J]. 四川大学学报(工程科学版), 2008(6): 154-158.
[13] 王新杰, 陈淮莉. 多中心联合取送货车辆路径优化与利润分配[J]. 计算机工程与应用, 2023, 59(3): 300-307.
[14] 王万良, 陈浩立, 李国庆, 等. 基于深度强化学习的多配送中心车辆路径规划[J]. 控制与决策, 2022, 37(8): 2101-2109.
[15] Xue, G., Wang, Y., Guan, X. and Wang, Z. (2022) A Combined GA-TS Algorithm for Two-Echelon Dynamic Vehicle Routing with Proactive Satellite Stations. Computers & Industrial Engineering, 164, Article ID: 107899. [Google Scholar] [CrossRef
[16] Moazzeni, S., Tavana, M. and Mostafayi Darmian, S. (2022) A Dynamic Location-Arc Routing Optimization Model for Electric Waste Collection Vehicles. Journal of Cleaner Production, 364, Article ID: 132571. [Google Scholar] [CrossRef