IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0343245.html

An improved Newman fast division algorithm based on multi-factor correlation for dynamic traffic sub-region control

Author

Listed:
  • Xiujuan Tian
  • Jinyong Ding
  • Huanying Liu
  • Haoke Deng

Abstract

Given the ongoing expansion of urban traffic signal control coverage, it is imperative to systematically delineate sub-regions based on the topology of road networks and traffic flow characteristics to enhance the stability of traffic management systems. To enhance the rationality of dynamic control sub-region division, this paper establishes a traffic-mechanism-driven edge weight construction framework integrated with modilarity-based community detection. This model integrates traffic volume, signal cycle, and traffic density to compute a comprehensive correlation degree between adjacent intersections. Furthermore, an entropy-weighted TOPSIS framework is proposed to objectively evaluate the proximity of neighboring nodes. This proximity measure is subsequently utilized as the edge weight within an improved Newman fast partitioning algorithm, thereby augmenting modularity and guiding the delineation of sub-regions. Empirical results indicate that while the conventional Newman algorithm exhibits limited adaptability to complex traffic patterns, the proposed model yields more distinct and precise sub-region divisions that more accurately reflect actual traffic conditions. Consequently, this methodology provides a robust foundation for the development of more effective signal control strategies.

Suggested Citation

  • Xiujuan Tian & Jinyong Ding & Huanying Liu & Haoke Deng, 2026. "An improved Newman fast division algorithm based on multi-factor correlation for dynamic traffic sub-region control," PLOS ONE, Public Library of Science, vol. 21(3), pages 1-34, March.
  • Handle: RePEc:plo:pone00:0343245
    DOI: 10.1371/journal.pone.0343245
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0343245
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0343245&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0343245?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0343245. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.