Road network partitioning method based on canopy-kmeans clustering algorithm

被引:0
作者
Lin X. [1 ]
Xu J. [2 ]
机构
[1] Institute of Rail Traffic, Guangdong Communication Polytechnic, Guangzhou
[2] School of Civil Engineering and Transportation, South China University of Technology, Guangzhou
来源
Lin, Xiaohui (linxh1981@163.com) | 1600年 / Warsaw University of Technology卷 / 54期
关键词
Canopy clustering algorithm; Kmeans clustering algorithm; Macroscopic fundamental diagram; Road network partition; Traffic engineering;
D O I
10.5604/01.3001.0014.2970
中图分类号
学科分类号
摘要
With the increasing scope of traffic signal control, in order to improve the stability and flexibility of the traffic control system, it is necessary to rationally divide the road network according to the structure of the road network and the characteristics of traffic flow. However, road network partition can be regarded as a clustering process of the division of road segments with similar attributes, and thus, the clustering algorithm can be used to divide the sub-areas of road network, but when Kmeans clustering algorithm is used in road network partitioning, it is easy to fall into the local optimal solution. Therefore, we proposed a road network partitioning method based on the Canopy-Kmeans clustering algorithm based on the real-time data collected from the central longitude and latitude of a road segment, average speed of a road segment, and average density of a road segment. Moreover, a vehicle network simulation platform based on Vissim simulation software is constructed by taking the real-time collected data of central longitude and latitude, average speed and average density of road segments as sample data. Kmeans and Canopy-Kmeans algorithms are used to partition the platform road network. Finally, the quantitative evaluation method of road network partition based on macroscopic fundamental diagram is used to evaluate the results of road network partition, so as to determine the optimal road network partition algorithm. Results show that these two algorithms have divided the road network into four sub-areas, but the sections contained in each sub-area are slightly different. Determining the optimal algorithm on the surface is impossible. However, Canopy-Kmeans clustering algorithm is superior to Kmeans clustering algorithm based on the quantitative evaluation index (e.g. the sum of squares for error and the R-Square) of the results of the subareas. Canopy-Kmeans clustering algorithm can effectively partition the road network, thereby laying a foundation for the subsequent road network boundary control. © 2020 Warsaw University of Technology. All rights reserved.
引用
收藏
页码:95 / 106
页数:11
相关论文
共 26 条
  • [21] Load balancing of multi-AGV road network based on improved Q-learning algorithm and macroscopic fundamental diagram
    Xiumei Zhang
    Wensong Li
    Hui Li
    Yue Liu
    Fang Liu
    [J]. Complex & Intelligent Systems, 2024, 10 : 3025 - 3039
  • [22] Decision Support System with K-Means Clustering Algorithm for Detecting the Optimal Store Location Based on Social Network Events
    Hamada, Mohamed Ahmed
    Naizabayeva, Lyazat
    [J]. 2020 IEEE EUROPEAN TECHNOLOGY AND ENGINEERING MANAGEMENT SUMMIT (E-TEMS 2020), 2020,
  • [23] Design Method for Travel E-commerce Platform Based on HHO improved K-means Clustering Algorithm
    Dang, Mihua
    Yang, Suiming
    [J]. EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS, 2024, 11 (05):
  • [24] Dynamic partitioning method for the multilayer boundary for urban oversaturated homogeneous traffic networks based on macroscopic fundamental diagrams in connected-vehicle network
    Lin X.
    Xu J.
    Zhou W.
    [J]. Advances in Transportation Studies, 2019, 48 : 47 - 62
  • [25] Dynamic parking charge-perimeter control coupled method for a congested road network based on the aggregation degree characteristics of parking generation distribution
    Ding, Heng
    Qian, Yu
    Zheng, Xiaoyan
    Bai, Haijian
    Wang, Shiguang
    Zhou, Jingwen
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 587
  • [26] A new data-adaptive network design methodology based on the k-means clustering and modified ISODATA algorithm for regional gravity field modeling via spherical radial basis functions
    Ulug, Rasit
    Karslioglu, Mahmut Onur
    [J]. JOURNAL OF GEODESY, 2022, 96 (11)