Abstract
Partitioning a heterogeneous road network into homogenous subnetworks is one way of solving the problem of high scattering or a hysteresis loop that may be inherent in the empirics of a macroscopic fundamental diagram. This study conducts cross-comparison analysis of two well-studied partitioning methods—(i) community detection through modularity maximization and (ii) normalized cut graph partitioning—to investigate the applicability of these methods. Through a case study using real traffic data recorded by an enormous number of detectors in the Tokyo central business district, we found that both methods work well for the test transportation network; however, undesirable results may be obtained if there is only one bottleneck in a subnetwork, or if there is a drastic change in traffic conditions between adjacent links.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Intelligent Transportation Systems Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
