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
相关论文
共 50 条
  • [1] Improved Optimization of Canopy-Kmeans Clustering Algorithm Based on Hadoop Platform
    Zhou, Gongjian
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND ELECTRICAL ENGINEERING 2018 (ICITEE '18), 2018,
  • [2] Research on Highway Passenger Segmentation Based on Canopy-kmeans Clustering Algorithm under Parallel Computing Framework
    Ma, Jun
    Luo, Shen
    Wu, Liuyang
    Luo, Guofu
    Li, Xiaoke
    Zhang, Dong
    2017 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTED, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2017,
  • [3] Intelligent scheduling in pre-burdening of iron ore: Canopy-Kmeans clustering algorithm and combinatorial optimization
    Cao Y.
    Wang Y.-L.
    He H.-M.
    Yang B.-S.
    Gui W.-H.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2017, 34 (07): : 947 - 955
  • [4] Abnormal Electricity Detection of Users Based on Improved Canopy-Kmeans and Isolation Forest Algorithms
    Wang, Jianyuan
    Li, Xiaoyao
    IEEE ACCESS, 2024, 12 : 99110 - 99121
  • [5] A HOT SPOT CLUSTERING METHOD BASED ON IMPROVED KMEANS ALGORITHM
    Zhang, Huiben
    Liu, Chunyu
    Zhang, Mengmeng
    Zhu, Ruifeng
    2017 14TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2017, : 32 - 35
  • [6] The water supply association analysis method in Shenzhen based on kmeans clustering discretization and apriori algorithm
    Liu, Xin
    Sang, Xuefeng
    Chang, Jiaxuan
    Zheng, Yang
    Han, Yuping
    PLOS ONE, 2021, 16 (08):
  • [7] Community Detection and Visualization in Complex Network by the Density-Canopy-Kmeans Algorithm and MDS Embedding
    Li, Manzhi
    Wang, Hongtao
    Long, Haixia
    Xiang, Ju
    Wang, Bo
    Xu, Junlin
    Yang, Jialiang
    IEEE ACCESS, 2019, 7 : 120616 - 120625
  • [8] Clustering Method of Raw Meal Composition Based on PCA and Kmeans
    Lu, Shizeng
    Yu, Hongliang
    Wang, Xiaohong
    Zhang, Qiang
    Li, Fanjun
    Liu, Zhao
    Ning, Fangqian
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 9007 - 9010
  • [9] A Parallel Cop-Kmeans Clustering Algorithm Based on MapReduce Framework
    Lin, Chao
    Yang, Yan
    Rutayisire, Tonny
    KNOWLEDGE ENGINEERING AND MANAGEMENT, 2011, 123 : 93 - 102
  • [10] A RBFN hierarchical clustering based network partitioning method for zonal pricing
    Yang, HM
    Zhou, RJ
    Liu, JH
    2005 2nd International Conference on Electrical & Electronics Engineering (ICEEE), 2005, : 282 - 285