IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v25y2025i1d10.1007_s11067-024-09661-z.html
   My bibliography  Save this article

A Backtracking Algorithm for Solving the Nearly Equitable Strong Edge-coloring Problem on Transportation Network

Author

Listed:
  • Kai Zhang

    (The Hong Kong Polytechnic University
    Southeast University, Jiulonghu Campus)

  • Yu Dong

    (Southeast University, Jiulonghu Campus)

  • Lin Cheng

    (Southeast University, Jiulonghu Campus)

  • Xinyuan Chen

    (Nanjing University of Aeronautics and Astronautics)

  • Qixiu Cheng

    (University of Bristol)

  • Zhiyuan Liu

    (Southeast University, Jiulonghu Campus)

Abstract

Faced with the challenges of continuously expanding traffic network scales and increasing travel demands in practical engineering problems, the computation required by traditional algorithms for solving large-scale traffic assignment problem (TAP) is expanding, making it increasingly difficult to balance computational efficiency and accuracy. The search for effective decomposition methods suitable for large-scale TAP has been a prominent focus. However, the complexity of the transportation network topology makes it challenging for existing traffic assignment algorithms to decompose the network. This paper utilizes the edge color theory from graph theory, the topology of transportation networks is deeply analyzed, and the characteristics of two-way edge coloring are defined in transportation networks. To further decompose the network at the level of link variables, a backtracking algorithm is presented for solving the nearly equitable strong edge-coloring (NESEC) problem. The proposed algorithm provides a theoretical foundation for modeling parallel traffic assignment based on the alternative direction method of multipliers (ADMM). The backtracking algorithm makes NESEC results easier for the ADMM-based traffic assignment model to perform parallel computation and enables the parallel calculation on thousands of link-based subproblems on large-scale TAP. The proposed algorithm was validated by conducting numerical experiments.

Suggested Citation

  • Kai Zhang & Yu Dong & Lin Cheng & Xinyuan Chen & Qixiu Cheng & Zhiyuan Liu, 2025. "A Backtracking Algorithm for Solving the Nearly Equitable Strong Edge-coloring Problem on Transportation Network," Networks and Spatial Economics, Springer, vol. 25(1), pages 219-248, March.
    • Handle: RePEc:kap:netspa:v:25:y:2025:i:1:d:10.1007_s11067-024-09661-z
    DOI: 10.1007/s11067-024-09661-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-024-09661-z
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-024-09661-z?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.

    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:kap:netspa:v:25:y:2025:i:1:d:10.1007_s11067-024-09661-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.