A degree-based genetic algorithm for constrained pinning control in complex networks

Cui-Li Yang; Wallace Kit-Sang Tang

doi:10.1109/ISCAS.2012.6272189

A degree-based genetic algorithm for constrained pinning control in complex networks

Cui-Li Yang
, Wallace Kit-Sang Tang

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

3 Citations (Scopus)

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.

Original language	English
Title of host publication	ISCAS 2012 - 2012 IEEE International Symposium on Circuits and Systems
Pages	902-905
DOIs	https://doi.org/10.1109/ISCAS.2012.6272189
Publication status	Published - 2012
Event	2012 IEEE International Symposium on Circuits and Systems (ISCAS 2012) - Seoul, Korea, Republic of Duration: 20 May 2012 → 23 May 2012

Conference

Conference	2012 IEEE International Symposium on Circuits and Systems (ISCAS 2012)
Abbreviated title	ISCAS 2012
Place	Korea, Republic of
City	Seoul
Period	20/05/12 → 23/05/12

Access Output

10.1109/ISCAS.2012.6272189

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{295f50a3c472433299b157680500c654,

title = "A degree-based genetic algorithm for constrained pinning control in complex networks",

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. {\textcopyright} 2012 IEEE.",

author = "Cui-Li Yang and Tang, \{Wallace Kit-Sang\}",

year = "2012",

doi = "10.1109/ISCAS.2012.6272189",

language = "English",

pages = "902--905",

booktitle = "ISCAS 2012 - 2012 IEEE International Symposium on Circuits and Systems",

note = "2012 IEEE International Symposium on Circuits and Systems (ISCAS 2012), ISCAS 2012 ; Conference date: 20-05-2012 Through 23-05-2012",

}

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 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - A degree-based genetic algorithm for constrained pinning control in complex networks

AU - Yang, Cui-Li

AU - Tang, Wallace Kit-Sang

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84866621660

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84866621660&origin=recordpage

U2 - 10.1109/ISCAS.2012.6272189

DO - 10.1109/ISCAS.2012.6272189

M3 - RGC 32 - Refereed conference paper (with host publication)

SP - 902

EP - 905

BT - ISCAS 2012 - 2012 IEEE International Symposium on Circuits and Systems

T2 - 2012 IEEE International Symposium on Circuits and Systems (ISCAS 2012)

Y2 - 20 May 2012 through 23 May 2012

ER -

A degree-based genetic algorithm for constrained pinning control in complex networks

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this