Characterizing Evolutionary Algorithm using Complex NetworksTheory: a Case Study

摘要：

Evolutionary algorithms (EAs) are a type of complex systems which mimic biological evolution in nature to solve real world problems.In this paper,we propose to use complex networks theory to characterize the topological properties of evolutionary algorithms (EAs).A case study on Guos algorithm is given as an example to show how to use our method.In our method,we represent the evolutionary process of Guos algorithm as a directed network,directed evolutionary algorithm network (DEAN).Many aspects of DEAN are analyzed,such as degree distribution,average path length,assortativity coefficient,and clustering coefficient.Our results imply that DEAN is a smallworld and scare-free type network.Our results give great insight into the underlining regularities in EAs.

关键词： evolutionary algorithm funtion optimization complex networks small world scale free

作者: Yan Liu Yi Zeng

作者单位: School of Information Science and Technology Jiujiang University Jiangxi,China

会议类型: 国际会议

会议名称: 2010 4th International Conference on Intelligent Information Techonlogy Application(第四届智能信息技术应用国际学术研讨会 IITA 2010)

会议地点: 秦皇岛

会议语种:英文

页码: 422-425

在线出版日期: 2010-11-05（万方平台首次上网日期，不代表论文的发表时间）