Analysing evolutionary algorithm dynamics using complex network theory: a primary study
by Weifeng Pan; Jing Wang; Chengxiang Yuan; Jianming Zhang; Hongyan Xue
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 4, 2013

Abstract: Evolutionary algorithms (EAs) are capable to effectively solve hard problems from various fields. When applying EAs to solve specific problems, a huge amount of data will be produced in the process. Due to lack of suitable tools, people seldom explore the rich information in algorithm exclusions, making we are in dark of the dynamics of EAs. Inspired by complex networks research, in this paper, we present a new method to analyse the dynamics of EAs in the form of complex networks. It uses a network model to describe the individuals and their gene relationships. It introduces the parameters of the complex network theory to characterise the evolution of the network. Some properties hidden in the dynamics of EAs are uncovered.

Online publication date: Sat, 10-May-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com