Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dawkins R (1976) The selfish Gene. Oxford University Press, Oxford
Duan Q, Sorooshian S, Gupta V (1992) Effective and efficient global optimization for conceptual rainfall-runoff models. Water Resour Res 28(4):1015–1031
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
Eberhart RC, Dobbins RW, Simpson P (1996) Computational intelligence PC tools. Academic, Boston
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
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
Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154. https://doi.org/10.1080/03052150500384759
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Gandhi, B.G.R., Bhattacharjya, R.K. (2020). Introduction to Shuffled Frog Leaping Algorithm and Its Sensitivity to the Parameters of the Algorithm. In: Bennis, F., Bhattacharjya, R. (eds) Nature-Inspired Methods for Metaheuristics Optimization. Modeling and Optimization in Science and Technologies, vol 16. Springer, Cham. https://doi.org/10.1007/978-3-030-26458-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-26458-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26457-4
Online ISBN: 978-3-030-26458-1
eBook Packages: EngineeringEngineering (R0)