×

Introduction to shuffled frog leaping algorithm and its sensitivity to the parameters of the algorithm. (English) Zbl 1436.90159

Bennis, Fouad (ed.) et al., Nature-inspired methods for metaheuristics optimization. Algorithms and applications in science and engineering. Cham: Springer. Model. Optim. Sci. Technol. 16, 105-117 (2020).
Summary: The optimization techniques is an essential tool in many fields of science and engineering. The evolution of humans and several other species teaches us many techniques which can be replicated to solve the nonlinear nonconvex optimization problems in an efficient and faster way. One such evolutionary trait from frogs can be thought of as an efficient optimization algorithm. This algorithm is based on the food search by an army of frogs. An army of frogs in a swamp search for food on the rocks floating around by leaping onto the nearest possible rock and also communicating with the rest of the frogs for improvising the search process. Each individual frog tries to get maximum food as fast as possible and thus developing a strategy to time their leaps in the best possible way. The algorithm developed replicating this process is called the Shuffled Frog Leaping Algorithm. This chapter discusses the basic principle of Shuffled Frog Leaping Algorithm and its efficiency using common benchmark optimization functions.
For the entire collection see [Zbl 1432.90007].

MSC:

90C59 Approximation methods and heuristics in mathematical programming
90C26 Nonconvex programming, global optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dawkins R (1976) The selfish Gene. Oxford University Press, Oxford
[2] Duan Q, Sorooshian S, Gupta V (1992) Effective and efficient global optimization for conceptual rainfall-runoff models. Water Resour Res 28(4):1015-1031 · doi:10.1029/91WR02985
[3] Eberhart RC, Kennedy J (1995) A new optimizer using particles swarm theory. In: Proceedings of the 6th international symposium on micro machine and human science, Nagoya, Japan, 1995, IEEE Service Center, Piscataway, pp 39-43
[4] Eberhart RC, Dobbins RW, Simpson P (1996) Computational intelligence PC tools. Academic, Boston
[5] Eusuff MM, Lansey KE (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm (SFLA). J Water Resour Plan Manag Am Soc Civ Eng 129(3):210-225 · doi:10.1061/(ASCE)0733-9496(2003)129:3(210)
[6] Kennedy J (1997) The particle swarm: social adaptation of knowledge. In: Proceedings of the IEEE international conference on evolutionary computation, Indianapolis, IN, USA, IEEE Service Center, Piscataway, pp 303-308
[7] Eusuff M, Lansey K, Pasha F (2006) Shuffled frog- · doi:10.1080/03052150500384759
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.