Impact of Levy flight on modern meta-heuristic optimizers

作     者：Emary, E. Zawbaa, Hossam M. Sharawi, Marwa 

作者机构：Cairo Univ Fac Comp & Informat Giza Egypt Arab Open Univ Fac Comp Studies Cairo Egypt Beni Suef Univ Fac Comp & Informat Bani Suwayf Egypt Babes Bolyai Univ Fac Math & Comp Sci Cluj Napoca Romania 

出 版 物：《APPLIED SOFT COMPUTING》 (应用软计算)

年 卷 期：2019年第75卷

页      面：775-789页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：IPROCOM Marie Curie initial training network  Romania through People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme FP7/2007-2013/under REA 

主　　题：Whale optimization algorithm Sine-cosine algorithm Levy flight Levy whale optimization algorithm Levy sine-cosine algorithm 

摘      要：In this paper, a variant based on Levy flight was proposed to enhance the performance of two recently proposed optimizers. The first optimizer used in the study is Sine-Cosine Algorithm ( SCA) while the second is Whale Optimization Algorithm (WOA). Both optimizers are composed of two phases of random walks in each optimization iteration and both have stagnation and premature convergence problems. Levy flight is used to replace the walk based on cosine function in the SCA and the spiral motion in the WOA as well. The Levy-based search guarantees a fraction of solutions to be generated apart from the current best solution and hence tolerates for optimizer stagnation, premature convergence, and allows for local optima avoidance. A smooth control of the scale of the Levy random walk is also proposed to ensure a smooth adaptation of exploration to exploitation switching. The proposed variants, as well as the original algorithms, were benchmarked using a set of unimodal, multimodal, fixed-dimension multimodal and composite benchmark functions. The evaluation is performed using a set of assessment indicators and results prove the capability of the proposed variants to outperform the original optimizers. (C) 2018 Elsevier B.V. All rights reserved.