IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5780747.html
   My bibliography  Save this article

ACO-Based Neural Network to Enhance the Efficiency of Network Controllability of Temporal Networks

Author

Listed:
  • Jie Zhang
  • Ling Ding
  • Peyman Arebi

Abstract

The controllability of temporal networks has been one of the most important challenges in this type of network over the last decade. The main goal of network controllability processes is to find the minimum set of control nodes in such a way that all network nodes can be controlled by them. This problem is NP-hard in the temporal networks. In this paper, a controllability method is proposed to improve the efficiency of the controllability process on temporal networks. In the proposed method, a population method based on the ant colony optimization (ACO) algorithm is proposed, which is compatible with temporal networks. Due to the temporal nature of the controllability processes in temporal networks, the ACO algorithm is adapted temporally. Also, due to the time-consuming controllable processes in temporal networks and in order to increase the efficiency of the ACO algorithm, a backpropagation neural network has been used, which finds the minimum driver node set of the network based on the layered model in order to fully control the network nodes. The results of the implementation of the proposed method on real-world datasets demonstrate that the proposed ACO-BPNN method works stably and with high efficiency on high-volume datasets. By comparing the efficiency of the proposed method with conventional controllability methods, it is found that the proposed method has performed better in terms of the speed of execution and the length of the minimum driver node set.

Suggested Citation

  • Jie Zhang & Ling Ding & Peyman Arebi, 2025. "ACO-Based Neural Network to Enhance the Efficiency of Network Controllability of Temporal Networks," Complexity, Hindawi, vol. 2025, pages 1-21, July.
  • Handle: RePEc:hin:complx:5780747
    DOI: 10.1155/cplx/5780747
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2025/5780747.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2025/5780747.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/cplx/5780747?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:hin:complx:5780747. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.