International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 32 - Number 1 |
Year of Publication: 2011 |
Authors: Mohammad Pourmahmood Aghababa, Mohammd Esmaeel Akbari, Amin Mohammadpour Shotorbani |
10.5120/3870-5406 |
Mohammad Pourmahmood Aghababa, Mohammd Esmaeel Akbari, Amin Mohammadpour Shotorbani . An Efficient Modified Shuffled Frog Leaping Optimization Algorithm. International Journal of Computer Applications. 32, 1 ( October 2011), 26-30. DOI=10.5120/3870-5406
In this paper, a modified shuffled frog leaping (MSFL) algorithm is proposed to overcome drawbacks of standard shuffled frog leaping (SFL) method. The MSFL approach is based on two major modifications on the conventional SFL method: (1) an adaptive accelerated position changing of frogs and (2) sweeping between randomly selected frogs (called superseding frogs). The first modification causes a fast convergence rate and consequently achieving a rapid adaptive algorithm, while the second one causes a better diversification and consequently escaping from local optimum traps. The MSFL algorithm performance is validated using benchmark functions. Simulation results indicate the superiority of MSFL to that of the original SFL in terms of optimal precision and fast convergence rate.