{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T21:47:28Z","timestamp":1768513648133,"version":"3.49.0"},"reference-count":40,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T00:00:00Z","timestamp":1691193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52072129"],"award-info":[{"award-number":["52072129"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>The urban road network is a large and complex system characterized by significant heterogeneity arising from different spatial structures and traffic demands. To facilitate effective management and control, it is necessary to partition the road network into homogeneous sub-areas. In this regard, we aim to propose a hybrid method for partitioning sub-areas with intra-area homogeneity, inter-area heterogeneity, and similar sizes, called CSDRA. It is specifically designed for bidirectional road networks with segment weights that encompass traffic flow, speed, or roadside facility evaluation. Based on community detection and spectral clustering, this proposed method comprises four main modules: initial partition, partitioning of large sub-areas, reassignment of small sub-areas, and boundary adjustment. In the preliminary partitioning work, we also design a road network reconstruction method which further helps to enhance the intra-area homogeneity and inter-area heterogeneity of partitioning results. Furthermore, to align with the requirement for comparable work units in practical traffic management and control, we control the similarity in the size of sub-areas by enforcing upper and lower bound constraints on the size of the sub-areas. We verify the outperformance of the proposed method by an experiment on the partitioning of an urban road network in Guangzhou, China, where we employ sidewalk barrier-free score data as segment weights. The results demonstrate the effectiveness of both the road network reconstruction method and the CSDRA proposed in this paper, as they significantly improve the partitioning outcomes compared with other methods using different evaluation indicators corresponding to the partitioning objectives. Finally, we investigate the influence of constraint parameters on the evaluation indicator. Our findings indicate that appropriately configuring these constraint parameters can effectively minimize sub-region size variations while having minimal impact on other aspects.<\/jats:p>","DOI":"10.3390\/ijgi12080327","type":"journal-article","created":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T10:21:39Z","timestamp":1691230899000},"page":"327","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Research on Road Network Partitioning Considering the Coupling of Network Connectivity and Traffic Attributes"],"prefix":"10.3390","volume":"12","author":[{"given":"Yingying","family":"Ma","sequence":"first","affiliation":[{"name":"Department of Transportation Engineering, South China University of Technology, 381 Wushan Road, Guangzhou 510641, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minglang","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Transportation Engineering, South China University of Technology, 381 Wushan Road, Guangzhou 510641, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoran","family":"Qin","sequence":"additional","affiliation":[{"name":"Department of Transportation Engineering, South China University of Technology, 381 Wushan Road, Guangzhou 510641, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zeng","sequence":"additional","affiliation":[{"name":"Guangzhou Urban Planning & Design Survey Research Institute, 10 Jianshe Damalu, Guangzhou 510060, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingyu","family":"Zeng","sequence":"additional","affiliation":[{"name":"Guangzhou Urban Planning & Design Survey Research Institute, 10 Jianshe Damalu, Guangzhou 510060, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,5]]},"reference":[{"key":"ref_1","first-page":"145","article-title":"Dynamic Network Partitioning Method Based on Intersections with Different Degree of Saturation","volume":"17","author":"Jianmin","year":"2017","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"key":"ref_2","first-page":"412","article-title":"Cross Comparison of Spatial Partitioning Methods for an Urban Transportation Network","volume":"18","author":"Dantsuji","year":"2020","journal-title":"Int. J. Intell. Transp. Syst. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"20664","DOI":"10.1109\/TITS.2022.3184082","article-title":"Urban Road Network Partitioning Based on Bi-Modal Traffic Flows with Multiobjective Optimization","volume":"23","author":"Chen","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_4","first-page":"518","article-title":"A network partitioning methodology for distributed traffic management applications","volume":"10","author":"Etemadnia","year":"2014","journal-title":"Transp. A Transp. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1080\/15472450.2016.1151792","article-title":"Large-scale network partitioning for decentralized traffic management and other transportation applications","volume":"20","author":"Johnson","year":"2016","journal-title":"J. Intell. Transp. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.trb.2016.05.008","article-title":"Clustering of heterogeneous networks with directional flows based on \u201cSnake\u201d similarities","volume":"91","author":"Saeedmanesh","year":"2016","journal-title":"Transp. Res. Part B-Methodol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.trb.2017.08.021","article-title":"Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks","volume":"105","author":"Saeedmanesh","year":"2017","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.trc.2018.02.015","article-title":"Identification of communities in urban mobility networks using multi-layer graphs of network traffic","volume":"89","author":"Yildirimoglu","year":"2018","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.3141\/2421-02","article-title":"Macroscopic Fundamental Diagram for Brisbane, Australia Empirical Findings on Network Partitioning and Incident Detection","volume":"2421","author":"Tsubota","year":"2014","journal-title":"Transp. Res. Rec."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1177\/0361198118799039","article-title":"Network Partitioning Algorithms for Solving the Traffic Assignment Problem using a Decomposition Approach","volume":"2672","author":"Yahia","year":"2018","journal-title":"Transp. Res. Rec."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Dimitriou, L., and Nikolaou, P. (2017, January 26\u201328). Dynamic partitioning of urban road networks based on their topological and operational characteristics. Proceedings of the 2017 5th IEEE International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS), Naples, Italy.","DOI":"10.1109\/MTITS.2017.8005715"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1687814017723790","DOI":"10.1177\/1687814017723790","article-title":"Analysis of traffic state variation patterns for urban road network based on spectral clustering","volume":"9","author":"Yang","year":"2017","journal-title":"Adv. Mech. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1016\/j.trb.2012.08.005","article-title":"On the spatial partitioning of urban transportation networks","volume":"46","author":"Ji","year":"2012","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_14","first-page":"238","article-title":"NCut partitioning algorithm for urban road networks based on similarity of traffic flow time series","volume":"21","author":"Ru","year":"2021","journal-title":"J. Traffic Transp. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"88","DOI":"10.3141\/2595-10","article-title":"Temporal Tracking of Congested Partitions in Dynamic Urban Road Networks","volume":"2595","author":"Anwar","year":"2016","journal-title":"Transp. Res. Rec."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Withanage, C., Lakmal, D., Hansini, M., Kankanamge, K., Witharanage, Y., and Thayasivam, U. (2018, January 20\u201322). A modified multilevel k-way partitioning algorithm for trip-based road networks. Proceedings of the 2nd International Conference on Functional Materials and Chemical Engineering (ICFMCE), Khalifa Univ, Abu Dhabi, United Arab Emirates.","DOI":"10.1051\/matecconf\/201927201038"},{"key":"ref_17","first-page":"2478","article-title":"Traffic regional division method based on improved spectral clustering algorithm","volume":"42","author":"Di","year":"2021","journal-title":"Comput. Eng. Des."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1109\/TITS.2016.2596321","article-title":"Detecting Communities on Topic of Transportation With Sparse Crowd Annotations","volume":"18","author":"Cao","year":"2017","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_19","first-page":"95","article-title":"A Division Method of Macro and Medium Level of Commuting Analysis Unit Based on Community Detecting Algorithm:A Case Study in Wuhan Central Area","volume":"38","author":"Qiang","year":"2020","journal-title":"J. Transp. Inf. Saf."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1949","DOI":"10.1111\/tgis.12755","article-title":"Analysis of urban agglomeration structure through spatial network and mobile phone data","volume":"25","author":"Liu","year":"2021","journal-title":"Trans. GIS"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"29729","DOI":"10.1109\/ACCESS.2018.2841321","article-title":"Comparing Community Detection Algorithms in Transport Networks via Points of Interest","volume":"6","author":"Huang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.is.2016.09.006","article-title":"Partitioning road networks using density peak graphs: Efficiency vs. accuracy","volume":"64","author":"Anwar","year":"2017","journal-title":"Inf. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1109\/TKDE.2018.2795001","article-title":"Capturing the Spatiotemporal Evolution in Road Traffic Networks","volume":"30","author":"Anwar","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1109\/TITS.2015.2413453","article-title":"A Partition-Based Match Making Algorithm for Dynamic Ridesharing","volume":"16","author":"Pelzer","year":"2015","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"40175","DOI":"10.1109\/ACCESS.2019.2905618","article-title":"A New Combinatorial Characteristic Parameter for Clustering-Based Traffic Network Partitioning","volume":"7","author":"Liu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"119974","DOI":"10.1016\/j.jclepro.2020.119974","article-title":"Mobile phone data in urban bicycle-sharing: Market-oriented sub-area division and spatial analysis on emission reduction potentials","volume":"254","author":"Yu","year":"2020","journal-title":"J. Clean. Prod."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1109\/TITS.2017.2713808","article-title":"A Network Partitioning Algorithmic Approach for Macroscopic Fundamental Diagram-Based Hierarchical Traffic Network Management","volume":"19","author":"An","year":"2018","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1111\/mice.12895","article-title":"Partitioning of urban networks with polycentric congestion pattern for traffic management policies: Identifying protected networks","volume":"38","author":"Jiang","year":"2022","journal-title":"Comput.-Aided Civ. Infrastruct. Eng."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1177\/0361198119843264","article-title":"Approximative Network Partitioning for MFDs from Stationary Sensor Data","volume":"2673","author":"Ambuehl","year":"2019","journal-title":"Transp. Res. Rec."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.trb.2019.02.014","article-title":"Flow exchanges in multi-reservoir systems with spillbacks","volume":"122","author":"Guilhem","year":"2019","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.trc.2018.07.033","article-title":"Aggregation and travel time calculation over large scale traffic networks: An empiric study on the Grenoble City","volume":"95","author":"Casadei","year":"2018","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/10106049.2017.1404140","article-title":"A network distance and graph-partitioning-based clustering method for improving the accuracy of urban hotspot detection","volume":"34","author":"Zhao","year":"2019","journal-title":"Geocarto Int."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Fortunato, S. (2009). Community detection in graphs. arXiv.","DOI":"10.1007\/978-0-387-30440-3_76"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys. Review. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_35","unstructured":"Khan, B.S., and Niazi, M.A. (2017). Network Community Detection: A Review and Visual Survey. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"026109","DOI":"10.1103\/PhysRevE.85.026109","article-title":"Closed benchmarks for network community structure characterization","volume":"85","author":"Aldecoa","year":"2012","journal-title":"Phys. Rev. E"},{"key":"ref_37","first-page":"500","article-title":"Communicability graph and community structures in complex networks","volume":"214","author":"Estrada","year":"2009","journal-title":"Appl. Math. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"032006","DOI":"10.1088\/1742-6596\/1601\/3\/032006","article-title":"Population Cross Learning Algorithm Combining Greedy Search for Community Detection","volume":"1601","author":"Wang","year":"2020","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"53377","DOI":"10.1109\/ACCESS.2019.2911567","article-title":"Comparative Examination of Network Clustering Methods for Extracting Community Structures of a City From Public Transportion Smart Card Data","volume":"7","author":"Maeda","year":"2019","journal-title":"IEEE Access"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/8\/327\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:26:14Z","timestamp":1760127974000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/8\/327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,5]]},"references-count":40,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["ijgi12080327"],"URL":"https:\/\/doi.org\/10.3390\/ijgi12080327","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,5]]}}}