Complex networks and evolutionary algorithms

Abstract

In this paper, we investigate properties of complex networks produced by a successful evolution strategy Differential Evolution (DE) Algorithm. Numerical simulations of different DE strategies are studied on a set of problems. We use the network theory to describe characteristics of these networks. Preferential attachment, which can lead to creation of scale-free networks, is present in some DE strategies. We try to identify scale-free topology in complex networks produced by these DE strategies and discuss our results.