Abstract
The Lévy distribution, which represents a form of random walk (Lévy flight) consisting of a series of consecutive random steps, has recently been demonstrated to improve the performance of metaheuristic algorithms. Through consecutive random steps, Lévy flight is particularly beneficial for undertaking massive “jump” operations that allow the search to escape from a local optimum and restart in a different region of the search space. We examine this concept in this work by applying Lévy flight to weighted superposition attraction–repulsion algorithm (WSAR), a basic but effective swarm intelligence optimization method that was recently introduced in the literature. The experiments are performed on several constrained design optimization problems. The performance of the proposed Levy flight WSAR algorithm is compared with several metaheuristics including harmony search algorithm (HS) and plain WSAR. The computational results revealed that Levy flight WSAR (LF-WSAR) is able to outperform the other algorithms. HS and WSAR show competitive performance with each other. In addition, performance of the LF-WSAR is statistically compared with other algorithms through nonparametric statistical tests. According to the statistical results, the difference between LF-WSAR and other algorithm is statistically significant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Baykasoğlu A, Akpinar Ş (2017) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems—part 1: unconstrained optimization. Appl Soft Comput 56:520–540
Baykasoğlu A, Akpinar Ş (2015) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems—part 2: constrained optimization. Appl Soft Comput 37:396–415
Baykasoğlu A, Ozsoydan FB, Senol ME (2020) Weighted superposition attraction algorithm for binary optimization problems. Oper Res Int J 20(4):2555–2581
Baykasoğlu A, Şenol ME (2019) Weighted superposition attraction algorithm for combinatorial optimization. Expert Syst Appl 138:112792
Baykasoğlu A (2021) Optimizing cutting conditions for minimizing cutting time in multi-pass milling via weighted superposition attraction-repulsion (WSAR) algorithm. Int J Prod Res. http://doi.org/10.1080/00207543.2020.1767313
Baykasoğlu A, Akpinar Ş (2020) Enhanced superposition determination for weighted superposition attraction algorithm. Soft Comput 1–26
Viswanathan GM, Buldyrev SV, Havlin S, Da Luz MGE, Raposo EP, Stanley HE (1999) Optimizing the success of random searches. Nature 401(6756):911–914. Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163–191
Kim TH, Maruta I, Sugie T (2010) A simple and efficient constrained particle swarm optimization and its application to engineering design problems. Proc Inst Mech Eng C J Mech Eng Sci 224(2):389–400
Arora JS (1989) Introduction to optimum design. McGraw-Hill, New York
Baykasoğlu A, Ozsoydan FB (2015) Adaptive firefly algorithm with chaos for mechanical design optimization problems. Appl Soft Comput 36:152–164
Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. J Intell Manuf 23(4):1001–1014
Coello Coello CA, Becerra RL (2004) Efficient evolutionary optimization through the use of a cultural algorithm. Eng Optim 36(2):219–236
Mezura-Montes E, Coello CC, Landa-Becerra R (2003) Engineering optimization using simple evolutionary algorithm. In: Proceedings. 15th IEEE international conference on tools with artificial intelligence. IEEE, pp 149–156
Brajevic I, Tuba M (2013) An upgraded artificial bee colony (ABC) algorithm for constrained optimization problems. J Intell Manuf 24(4):729–740
Baykasoglu A (2012) Design optimization with chaos embedded great deluge algorithm. Appl Soft Comput 12(3):1055–1067
Aguirre AH, Zavala AM, Diharce EV, Rionda SB (2007) COPSO: constrained optimization via PSO algorithm. Center for Research in Mathematics (CIMAT). Technical report no. I-07-04/22-02-2007, 77
Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Baykasoğlu, A., Şenol, M.E. (2022). WSAR with Levy Flight for Constrained Optimization. In: Kim, J.H., Deep, K., Geem, Z.W., Sadollah, A., Yadav, A. (eds) Proceedings of 7th International Conference on Harmony Search, Soft Computing and Applications. Lecture Notes on Data Engineering and Communications Technologies, vol 140. Springer, Singapore. https://doi.org/10.1007/978-981-19-2948-9_21
Download citation
DOI: https://doi.org/10.1007/978-981-19-2948-9_21
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-2947-2
Online ISBN: 978-981-19-2948-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)