Fitness Based Position Update in Spider Monkey Optimization Algorithm

Abstract Spider Monkey Optimization (SMO) technique is most recent member in the family of swarm optimization algorithms.SMO algorithm fall in class of Nature Inspired Algorithm (NIA). SMO algorithm is good in exploration and exploitation of local search space and it is well balanced algorithm most of the times. This paper presents a new strategy to update position of solution during local leader phase using fitness of individuals. The proposed algorithm is named as Fitness based Position Update in SMO (FPSMO) algorithm as it updates position of individuals based on their fitness. The anticipated strategy enhances the rate of convergence. The planned FPSMO approach tested over nineteen benchmark functions and for one real world problem so as to establish superiority of it over basic SMO algorithm.

[1]  Rajeev Kumar,et al.  Performance Comparison of Diversity Techniques in MIMO Wireless Communication , 2014 .

[2]  Junjie Li,et al.  Artificial Bee Colony Algorithm with Local Search for Numerical Optimization , 2011, J. Softw..

[3]  Ajay Kumar,et al.  Data Security Framework for Offsite Storage of Data , 2014 .

[4]  Vivek Kumar Sharma,et al.  Modified Position Update in Spider Monkey Optimization Algorithm , 2014 .

[5]  Harish Sharma,et al.  Spider Monkey Optimization algorithm for numerical optimization , 2014, Memetic Computing.

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7]  Sam Kwong,et al.  Gbest-guided artificial bee colony algorithm for numerical function optimization , 2010, Appl. Math. Comput..

[8]  K. V. Arya,et al.  Opposition based lévy flight artificial bee colony , 2012, Memetic Computing.

[9]  Sandeep Kumar,et al.  Improved Onlooker Bee Phase in Artificial Bee Colony Algorithm , 2014, ArXiv.

[10]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[11]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[12]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[13]  Zelda B. Zabinsky,et al.  A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems , 2005, J. Glob. Optim..

[14]  Harish Sharma,et al.  Dynamic Swarm Artificial Bee Colony Algorithm , 2012, Int. J. Appl. Evol. Comput..

[15]  Sandeep Kumar,et al.  A Novel Hybrid Crossover based Artificial Bee Colony Algorithm for Optimization Problem , 2013, ArXiv.

[16]  Harish Sharma,et al.  Artificial bee colony algorithm: a survey , 2013, Int. J. Adv. Intell. Paradigms.

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

[18]  Harish Sharma,et al.  Memetic search in artificial bee colony algorithm , 2013, Soft Computing.

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

[20]  Sandeep Kumar,et al.  Randomized Memetic Artificial Bee Colony Algorithm , 2014, ArXiv.

[21]  Harish Sharma,et al.  Balanced artificial bee colony algorithm , 2013, Int. J. Artif. Intell. Soft Comput..

[22]  Sandeep Kumar,et al.  Memetic Search in Differential Evolution Algorithm , 2014, ArXiv.

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

[24]  D. Williamson,et al.  The box plot: a simple visual method to interpret data. , 1989, Annals of internal medicine.