Accelerated Shuffled Frog-Leaping Algorithm

Shuffled frog-leaping algorithm (SFLA) is a recent addition to the family of stochastic search methods that mimic the social and natural behavior of species. SFLA combines the advantages of local search process of particle swarm optimization (PSO) and mixing of information of the shuffled complex evolution. The basic idea behind modeling of such algorithms is to achieve near to global solutions to the large-scale optimization problems and complex problems which cannot be solved using deterministic or traditional numerical techniques. In this study, the searching process is accelerated using golden section-based scaling factor and the constraints are handled by the penalty functions. Penalty functions are used to find the optimal solution for restrained optimization problems in the feasible region of the total search space. The resulting algorithm is named as Accelerated-SFLA. The proposal is implemented to solve the problem of optimal selection of processes. The results illustrate the efficacy of the proposal.

[1]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

[2]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[3]  G. P. Rangaiah,et al.  Differential Evolution with Tabu List for Solving Nonlinear and Mixed-Integer Nonlinear Programming Problems , 2007 .

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

[5]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[6]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

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

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

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

[10]  J. Kiefer,et al.  Sequential minimax search for a maximum , 1953 .

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

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

[13]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[14]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .