IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v36y2025i03ns0129183124502036.html
   My bibliography  Save this article

An improved network dismantling strategy based on ant colony algorithm

Author

Listed:
  • Yongming Wang

    (School of Computer Science and Technology, Tianjin University of Technology, Tianjin 300191, P. R. China)

  • Shiwen Sun

    (School of Computer Science and Technology, Tianjin University of Technology, Tianjin 300191, P. R. China)

  • Zhen Wang

    (School of Computer Science and Technology, Tianjin University of Technology, Tianjin 300191, P. R. China)

  • Li Wang

    (School of Computer Science and Technology, Tianjin University of Technology, Tianjin 300191, P. R. China)

  • Chengyi Xia

    (School of Artificial Intelligence, Tiangong University, Tianjin 300387, P. R. China)

Abstract

Network dismantling, which aims at finding the optimal node sequence whose removal will dismantle the whole network effectively, remains as a hot topic in the research area of complex networks and systems. In this study, an improved network dismantling strategy based on ant-colony optimization algorithm is proposed. Through large quantities of numerical simulations, compared with several classical network dismantling methods, the effectiveness of the proposed strategy is verified. Current results can provide a new perspective for us to comprehend the complexity and optimization of complex networked systems.

Suggested Citation

  • Yongming Wang & Shiwen Sun & Zhen Wang & Li Wang & Chengyi Xia, 2025. "An improved network dismantling strategy based on ant colony algorithm," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 36(03), pages 1-16, March.
    • Handle: RePEc:wsi:ijmpcx:v:36:y:2025:i:03:n:s0129183124502036
    DOI: 10.1142/S0129183124502036
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183124502036
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183124502036?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:wsi:ijmpcx:v:36:y:2025:i:03:n:s0129183124502036. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.