A comparative study of Particle Swarm Optimization and Cuckoo Search techniques through problem-specific distance function

For the last two decades, nature inspired metaheuristic algorithms have shown their ubiquitous nature in almost every aspect, where computational intelligence is used. This paper intends to focus on the comparative study of two popular and robust bio mimic strategies used in computer engineering, namely Particle Swarm Optimization (PSO) and Cuckoo Search (CS). According to the results, CS outperforms PSO. The performance comparison of both algorithms is implemented in the form of problem specific distance functions rather than an algorithmic distance function. Also an attempt is taken to examine the claim that CS has the same effectiveness of finding the true global optimal solution as the PSO but with significantly better computational efficiency, which means less function evaluations.

[1]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[2]  Kenneth Morgan,et al.  Modified cuckoo search: A new gradient free optimisation algorithm , 2011 .

[3]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[4]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[5]  Pinar Civicioglu,et al.  A conceptual comparison of the Cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms , 2013, Artificial Intelligence Review.

[6]  A. Reynolds,et al.  Free-Flight Odor Tracking in Drosophila Is Consistent with an Optimal Intermittent Scale-Free Search , 2007, PloS one.

[7]  Yubin Xu,et al.  A Clustering Algorithm of Wireless Sensor Networks Based on PSO , 2011, AICI.

[8]  P. Barthelemy,et al.  A Lévy flight for light , 2008, Nature.

[9]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[10]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[11]  Ilya Pavlyukevich.  Lévy flights, non-local search and simulated annealing , 2007, J. Comput. Phys..

[12]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[13]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[14]  Sami J. Habib,et al.  Comparative study between the internal behavior of GA and PSO through problem-specific distance functions , 2005, 2005 IEEE Congress on Evolutionary Computation.

[15]  Zhang Bo.  Clustering algorithm in wireless sensor networks , 2009 .

[16]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[17]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[18]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[19]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[20]  Xin-She Yang,et al.  Engineering optimisation by cuckoo search , 2010, Int. J. Math. Model. Numer. Optimisation.