International Journal of Intelligent Systems and Applications (IJISA)
IJISA Vol. 7, No. 4, 8 Mar. 2015
Cover page and Table of Contents: PDF (size: 390KB)
Bespoke Shuffled Frog Leaping Algorithm and its Engineering Applications
Full Text (PDF, 390KB), PP.41-46
Views: 0 Downloads: 0
Author(s)
Index Terms
Shuffled Leap Frog Algorithm, SFLA, Engineering Design Problems, Optimization, Constrained Handling
Abstract
Shuffled Frog Leap Algorithm (SFLA), a metaheuristic algorithms inspired by PSO and DE has proved its efficacy in solving discrete optimization problems. In this paper we have modified SFLA to solve constrained engineering design problems. The proposed modification integrates a simple mechanism to update the position of frog in its memeplex in order to accelerate the basic SFLA algorithm. The proposal is validated on four engineering design problems and the statistical results are compared with the state-of-art algorithms. The simulated statistical results indicate that our proposal is a promising alternative to solve these types of optimization problems in terms of convergence speed.
Cite This Paper
Anurag Tripathi, Tarun K. Sharma, Vipul Singh, "Bespoke Shuffled Frog Leaping Algorithm and its Engineering Applications", International Journal of Intelligent Systems and Applications(IJISA), vol.7, no.4, pp.41-46, 2015. DOI:10.5815/ijisa.2015.04.06
Reference
[1]Goldberg D., Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley, (1989).
[2]Storn R. and Price K. V., “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” J. GlobalOptimization, vol. 11, pp. 341–359, (1997).
[3]J. Kennedy and R. C. Eberhart, “Particle Swarm Optimization”, Proceeding of IEEE International Conference on Neural Networks,Perth, Australia, IEEE Service Center, Piscataway, NJ (1995), pp. 1942–1948.
[4]D. Karaboga, “An Idea based on Bee Swarm for Numerical Optimization,”Technical Report, TR-06, Erciyes University Engineering Faculty, Computer Engineering Department (2005).
[5]Eusuff, M., Lansey, K.E.: “Optimization of water distribution network design using the shuffled frog leaping algorithm,” Water Resources Planning and Management 129(3), 210–225 (2003).
[6]TK Sharma, M Pant. “Redundancy Level Optimization in Modular Software System Models using ABC,” International Journal of Intelligent Systems and Applications (IJISA) 6 (4), 40, 2014.
[7]TK Sharma, M Pant. “Improvised Scout Bee Movements in Artificial Bee Colony,” I.J. Modern Education and Computer Science, 2014, 1, 1-16.
[8]TK Sharma, M Pant. “Swarm Intelligence in Pulp and Paper Process Optimization. Applications of Metaheuristics in Process Engineering,” 123-151, 2014.
[9]M Ali, CW Ahn, P Siarry. “Differential evolution algorithm for the selection of optimal scaling factors in image watermarking,” Engineering Applications of Artificial Intelligence, 31, 15-26, 2014.
[10]Panchi Li, Hong Xiao “An improved quantum-behaved particle swarm optimization algorithm,” Applied Intelligence, April 2014, Volume 40, Issue 3, pp 479-496
[11]Sunita Panda, Archana Sarangi, Siba Prasada Panigrahi. “A new training strategy for neural network using shuffled frog-leaping algorithm and application to channel equalization,” AEU - International Journal of Electronics and Communications. DOI: 10.1016/j.aeue.2014.05.005
[12]Tarun K. Sharma, Millie Pant and Deepshikha Bhargava, “Impact of Modification Rate in Artificial Bee Colony for Engineering Design Problems,” J. Information Engineering and Electronic Business, 2013, 6, 55-63
[13]Leticia C. Cagnina and Susana C. Esquivel, Carlos A. Coello Coello. “Solving Engineering Optimization Problems with the Simple Constrained Particle Swarm Optimizer,” Informatica, 32(2008) 319–326.
[14]A. Hernandez Aguirre, A. Muñoz Zavala, E. Villa Diharce and S. Botello Rionda. “COPSO: Constrained Optimization via PSO Algorithm,” Technical report No. I-07-04/22-02-2007, Center for Research in Mathematics (CIMAT), 2007.
[15]E. Mezura and C. Coello. “Useful Infeasible Solutions in Engineering Optimization with Evolutionary Algorithms,” Lect. Notes Comput. Sc. , 3789:652–662, 2005.