Structural Controllability Of Complex Networks Using The Genetic Algorithm

Recently,complex networks problems have attracted more and more attention,the structural controllability of complex networks has became one of the focus issues.However,the controllability of complex networks is still in its infancy,and there are still more problems to be solved.In 2011,Liu et al.proposed the theory of structural controllability of complex networks,and gave tne theorem of minimum number of drive nodes,and this theory becomes the pioneering work in the controllability of complex networks,which has attracted wide attention in many research fields.This paper first reviewed the background of complex networks and the research progress at home and abroad.Then we present the basic concepts on the complex networks and optimizations including the structural controllability,genetic algorithm,mathematical programming and other basic issues.Based on graph theory,control theory and optimization theory,this thesis proposes a framework for controlling the controllability of complex network structures using the genetic algorithm;and then integrates the penalty function into the optimization objective function to realize the processing of constraints.The problem of finding the minimum number of driven nodes in the network is transformed into the largest matching edge of the search graph,and then determined as the number of matching nodes.The paper proposed algorithm can be applied to complex networks of arbitrary structure,and the feasibility of the method is proved by examples,it provides a new idea for solving the problem of network controllability optimization.