IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v606y2022ics0378437122006884.html
   My bibliography  Save this article

GATC and DeepCut: Deep spatiotemporal feature extraction and clustering for large-scale transportation network partition

Author

Listed:
  • Zhang, Yuan
  • Li, Lu
  • Zhang, Wenbo
  • Cheng, Qixiu

Abstract

The network partition is an important method for many key transport problems, e.g., transport network zoning, parallel computing of traffic assignment problem, and analysis of the macroscopic fundamental diagram, to name a few. This paper designs two partition frameworks called GATC (Graph attention auto-encoder for clustering) and DeepCut, which can partition the transportation network into several components. These two frameworks combine unsupervised deep learning and clustering, taking into account both temporal factors and spatial factors. Firstly, the traffic flow time series data is encoded by graph attention auto-encoder, with graph structure and content considered. Secondly, the normalized cut method is used to partition the transportation network into several homogeneous sub-networks. DeepCut encodes the input data by a simple encoder, and the normalized cut method is used to partition the transportation network. The proposed methods are verified by a numerical example, which demonstrates the rationality and effectiveness of GATC and DeepCut for transportation network partition.

Suggested Citation

  • Zhang, Yuan & Li, Lu & Zhang, Wenbo & Cheng, Qixiu, 2022. "GATC and DeepCut: Deep spatiotemporal feature extraction and clustering for large-scale transportation network partition," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    • Handle: RePEc:eee:phsmap:v:606:y:2022:i:c:s0378437122006884
    DOI: 10.1016/j.physa.2022.128110
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437122006884
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2022.128110?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Saeedmanesh, Mohammadreza & Geroliminis, Nikolas, 2017. "Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 193-211.
    2. Pan, Ying & Li, De-Hua & Liu, Jian-Guo & Liang, Jing-Zhang, 2010. "Detecting community structure in complex networks via node similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(14), pages 2849-2857.
    3. Cheng, Qixiu & Liu, Zhiyuan & Lin, Yuqian & Zhou, Xuesong (Simon), 2021. "An s-shaped three-parameter (S3) traffic stream model with consistent car following relationship," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 246-271.
    4. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    5. Cui, Yaozu & Wang, Xingyuan & Li, Junqiu, 2014. "Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 85-91.
    6. Zhou, HongFang & Li, Jin & Li, JunHuai & Zhang, FaCun & Cui, YingAn, 2017. "A graph clustering method for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 551-562.
    7. Ji, Yuxuan & Geroliminis, Nikolas, 2012. "On the spatial partitioning of urban transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1639-1656.
    8. Liu, Zhiyuan & Wang, Zewen & Cheng, Qixiu & Yin, Ruyang & Wang, Meng, 2021. "Estimation of urban network capacity with second-best constraints for multimodal transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 276-294.
    9. Sun, Peng Gang & Sun, Xiya, 2017. "Complete graph model for community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 88-97.
    10. Saeedmanesh, Mohammadreza & Geroliminis, Nikolas, 2016. "Clustering of heterogeneous networks with directional flows based on “Snake” similarities," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 250-269.
    11. Xiaofeng Wang & Gongshen Liu & Jianhua Li & Jan P Nees, 2017. "Locating Structural Centers: A Density-Based Clustering Method for Community Detection," PLOS ONE, Public Library of Science, vol. 12(1), pages 1-23, January.
    12. Xing, Jiping & Wu, Wei & Cheng, Qixiu & Liu, Ronghui, 2022. "Traffic state estimation of urban road networks by multi-source data fusion: Review and new insights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 595(C).
    13. Jafari, Ehsan & Pandey, Venktesh & Boyles, Stephen D., 2017. "A decomposition approach to the static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 270-296.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tang, Siyi & Zheng, Fangfang & Zheng, Nan & Liu, Xiaobo, 2024. "An efficient multi-modal urban transportation network partitioning approach for three-dimensional macroscopic fundamental diagram," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 637(C).
    2. Leclercq, Ludovic & Ladino, Andres & Becarie, Cécile, 2021. "Enforcing optimal routing through dynamic avoidance maps," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 118-137.
    3. Guo, Yajuan & Yang, Licai & Hao, Shenxue & Gao, Jun, 2019. "Dynamic identification of urban traffic congestion warning communities in heterogeneous networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 98-111.
    4. Ambühl, Lukas & Loder, Allister & Bliemer, Michiel C.J. & Menendez, Monica & Axhausen, Kay W., 2020. "A functional form with a physical meaning for the macroscopic fundamental diagram," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 119-132.
    5. Xin, Xuri & Liu, Kezhong & Loughney, Sean & Wang, Jin & Li, Huanhuan & Ekere, Nduka & Yang, Zaili, 2023. "Multi-scale collision risk estimation for maritime traffic in complex port waters," Reliability Engineering and System Safety, Elsevier, vol. 240(C).
    6. Saeedmanesh, Mohammadreza & Geroliminis, Nikolas, 2017. "Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 193-211.
    7. Xin, Xuri & Liu, Kezhong & Loughney, Sean & Wang, Jin & Yang, Zaili, 2023. "Maritime traffic clustering to capture high-risk multi-ship encounters in complex waters," Reliability Engineering and System Safety, Elsevier, vol. 230(C).
    8. Gao, Shengling & Li, Daqing & Zheng, Nan & Hu, Ruiqi & She, Zhikun, 2022. "Resilient perimeter control for hyper-congested two-region networks with MFD dynamics," Transportation Research Part B: Methodological, Elsevier, vol. 156(C), pages 50-75.
    9. Gu, Xiaoning & Chen, Chao & Feng, Tao & Yao, Baozhen, 2024. "A novel regional traffic control strategy for mixed traffic system with the construction of congestion warning communities," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 639(C).
    10. Yao, Wenbin & Chen, Nuo & Su, Hongyang & Hu, Youwei & Jin, Sheng & Rong, Donglei, 2023. "A novel self-adaption macroscopic fundamental diagram considering network heterogeneity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 613(C).
    11. Mariotte, Guilhem & Leclercq, Ludovic & Batista, S.F.A. & Krug, Jean & Paipuri, Mahendra, 2020. "Calibration and validation of multi-reservoir MFD models: A case study in Lyon," Transportation Research Part B: Methodological, Elsevier, vol. 136(C), pages 62-86.
    12. Ge, Qian & Fukuda, Daisuke, 2019. "A macroscopic dynamic network loading model for multiple-reservoir system," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 502-527.
    13. Ding, Heng & Di, Yunran & Feng, Zhongxiang & Zhang, Weihua & Zheng, Xiaoyan & Yang, Tao, 2022. "A perimeter control method for a congested urban road network with dynamic and variable ranges," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 160-187.
    14. Batista, S.F.A. & Leclercq, Ludovic & Geroliminis, Nikolas, 2019. "Estimation of regional trip length distributions for the calibration of the aggregated network traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 192-217.
    15. Yin, Ruyang & Zheng, Nan & Liu, Zhiyuan, 2022. "Estimating fundamental diagram for multi-modal signalized urban links with limited probe data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
    16. Kouvelas, Anastasios & Saeedmanesh, Mohammadreza & Geroliminis, Nikolas, 2017. "Enhancing model-based feedback perimeter control with data-driven online adaptive optimization," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 26-45.
    17. Zheng, Nan & Geroliminis, Nikolas, 2020. "Area-based equitable pricing strategies for multimodal urban networks with heterogeneous users," Transportation Research Part A: Policy and Practice, Elsevier, vol. 136(C), pages 357-374.
    18. Gu, Ziyuan & Safarighouzhdi, Farshid & Saberi, Meead & Rashidi, Taha H., 2021. "A macro-micro approach to modeling parking," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 220-244.
    19. Raadsen, Mark P.H. & Bliemer, Michiel C.J. & Bell, Michael G.H., 2020. "Aggregation, disaggregation and decomposition methods in traffic assignment: historical perspectives and new trends," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 199-223.
    20. S. F. A. Batista & Ludovic Leclercq, 2019. "Regional Dynamic Traffic Assignment Framework for Macroscopic Fundamental Diagram Multi-regions Models," Transportation Science, INFORMS, vol. 53(6), pages 1563-1590, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:606:y:2022:i:c:s0378437122006884. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.