Exploring the shortest path in PSO communication network

摘要

In the recent years, complex networks and other network structures were successfully combined with various evolutionary computational techniques (ECTs) to improve the performance of ECTs. In this paper, we explore the attributes of the shortest path in communication network created by the particle swarm optimization algorithm and elaborate about possible uses of the knowledge gained from the analysis of the shortest path. We present the results of one thousand repeated runs over four well-known benchmark functions. We discuss the possible correlations of attributes of the shortest path and the solution quality and fitness landscape complexity.