A degree-based genetic algorithm for constrained pinning control in complex networks
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | ISCAS 2012 - 2012 IEEE International Symposium on Circuits and Systems |
| Pages | 902-905 |
| Publication status | Published - 2012 |
Conference
| Title | 2012 IEEE International Symposium on Circuits and Systems (ISCAS 2012) |
|---|---|
| Place | Korea, Republic of |
| City | Seoul |
| Period | 20 - 23 May 2012 |
Link(s)
Abstract
In this paper, a novel genetic algorithm (GA) is presented to tackle with the constrained pinning control problem for complex networks. The information of the node degree is incorporated in the design so that a set of pinned nodes can be duly obtained. In addition, the control strength of each selected node is assigned by the use of a decrease-and-conquer approach, satisfying the total control strength constraint of the problem. Simulation results confirm the effectiveness of the design and it outperforms other evolutionary algorithms and conventional node selection approaches. © 2012 IEEE.
Citation Format(s)
A degree-based genetic algorithm for constrained pinning control in complex networks. / Yang, Cui-Li; Tang, Wallace Kit-Sang.
ISCAS 2012 - 2012 IEEE International Symposium on Circuits and Systems. 2012. p. 902-905 6272189.Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
