scholarly journals Modified Bat Algorithm Based on Lévy Flight and Opposition Based Learning

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Xian Shan ◽  
Kang Liu ◽  
Pei-Liang Sun
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Real Life ◽  
Bat Algorithm ◽  
Global Optimum ◽  
Lévy Flight ◽  
Levy Flight ◽  
Local Optima ◽  
Opposition Based Learning ◽  
Modified Bat Algorithm

Bat Algorithm (BA) is a swarm intelligence algorithm which has been intensively applied to solve academic and real life optimization problems. However, due to the lack of good balance between exploration and exploitation, BA sometimes fails at finding global optimum and is easily trapped into local optima. In order to overcome the premature problem and improve the local searching ability of Bat Algorithm for optimization problems, we propose an improved BA called OBMLBA. In the proposed algorithm, a modified search equation with more useful information from the search experiences is introduced to generate a candidate solution, and Lévy Flight random walk is incorporated with BA in order to avoid being trapped into local optima. Furthermore, the concept of opposition based learning (OBL) is embedded to BA to enhance the diversity and convergence capability. To evaluate the performance of the proposed approach, 16 benchmark functions have been employed. The results obtained by the experiments demonstrate the effectiveness and efficiency of OBMLBA for global optimization problems. Comparisons with some other BA variants and other state-of-the-art algorithms have shown the proposed approach significantly improves the performance of BA. Performances of the proposed algorithm on large scale optimization problems and real world optimization problems are not discussed in the paper, and it will be studied in the future work.

scholarly journals Extension of Bat Algorithm on Standard Benchmark Functions

2020 ◽  
Vol 8 (5) ◽  
pp. 802-807
Keyword(s):  
Global Optimization ◽  
Pulse Rate ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Optimization Algorithms ◽  
Bat Algorithm ◽  
Lévy Flight ◽  
Levy Flight ◽  
Local Optima ◽  
Dynamic Pulse

Meta heuristics are superior methods of finding, producing and even modifying heuristics that are able to solve various optimization problems. All Meta-heuristic algorithms are influenced by the nature. These types of algorithms tend to mimic the behaviour of biotic components in nature and are emerging as an effective way of solving global optimization algorithms. We have reviewed that no any algorithm is best for all applications due to lack of generality (no. of parameters), non-dynamic input values. So, this paper studied BAT algorithm deeply and found weakness in terms of non-dynamic pulse rate and loudness. In order to avoid being trapped into local optima these inputs are made dynamic with inclusion of levy Flight too. Performance of this proposed Modified BAT approach is evaluated using few standard benchmark functions. For justifying the superiority of Modified BAT, its performance has been compared with standard Bat algorithm too. From simulation it is found that dynamic pulse rate and dynamic loudness improve the performance of Bat algorithm in terms of results without being stuck at local optima and is more general

Insulin DNA Sequence Classification Using Levy Flight Bat With Back Propagation Algorithm

2020 ◽  
pp. 232-252
Author(s):  
Siyab Khan ◽  
Abdullah Khan ◽  
Rehan Ullah ◽  
Maria Ali ◽  
Rahat Ullah
Keyword(s):  
Dna Sequence ◽  
Dna Sequences ◽  
Optimization Problems ◽  
Back Propagation ◽  
Bat Algorithm ◽  
Hybrid Models ◽  
Lévy Flight ◽  
Healthy Human ◽  
Levy Flight ◽  
Nature Inspired Algorithms

Various nature-inspired algorithms are used for optimization problems. Recently, one of the nature-inspired algorithms became famous because of its optimality. In order to solve the problem of low accuracy, famous computational methods like machine learning used levy flight Bat algorithm for the problematic classification of an insulin DNA sequence of a healthy human, one variant of the insulin DNA sequence is used. The DNA sequence is collected from NCBI. Preprocessing alignment is performed in order to obtain the finest optimal DNA sequence with a greater number of matches between base pairs of DNA sequences. Further, binaries of the DNA sequence are made for the aim of machine readability. Six hybrid algorithms are used for the classification to check the performance of these proposed hybrid models. The performance of the proposed models is compared with the other algorithms like BatANN, BatBP, BatGDANN, and BatGDBP in term of MSE and accuracy. From the simulations results it is shown that the proposed LFBatANN and LFBatBP algorithms perform better compared to other hybrid models.

scholarly journals Lévy-Flight Krill Herd Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Gaige Wang ◽  
Lihong Guo ◽  
Amir Hossein Gandomi ◽  
Lihua Cao ◽  
Amir Hossein Alavi ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Computing Time ◽  
Optimization Methods ◽  
Population Based ◽  
Global Optimum ◽  
Lévy Flight ◽  
Levy Flight ◽  
Krill Herd Algorithm ◽  
Krill Herd ◽  
Elitism Scheme

To improve the performance of the krill herd (KH) algorithm, in this paper, a Lévy-flight krill herd (LKH) algorithm is proposed for solving optimization tasks within limited computing time. The improvement includes the addition of a new local Lévy-flight (LLF) operator during the process when updating krill in order to improve its efficiency and reliability coping with global numerical optimization problems. The LLF operator encourages the exploitation and makes the krill individuals search the space carefully at the end of the search. The elitism scheme is also applied to keep the best krill during the process when updating the krill. Fourteen standard benchmark functions are used to verify the effects of these improvements and it is illustrated that, in most cases, the performance of this novel metaheuristic LKH method is superior to, or at least highly competitive with, the standard KH and other population-based optimization methods. Especially, this new method can accelerate the global convergence speed to the true global optimum while preserving the main feature of the basic KH.

scholarly journals Chaotic Teaching-Learning-Based Optimization with Lévy Flight for Global Numerical Optimization

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Xiangzhu He ◽  
Jida Huang ◽  
Yunqing Rao ◽  
Liang Gao
Keyword(s):  
Numerical Optimization ◽  
Large Scale ◽  
Heuristic Algorithms ◽  
Lévy Flight ◽  
Global Numerical Optimization ◽  
Levy Flight ◽  
Local Optima ◽  
Teaching Learning Based Optimization ◽  
Teaching Learning ◽  
Different Characteristics

Recently, teaching-learning-based optimization (TLBO), as one of the emerging nature-inspired heuristic algorithms, has attracted increasing attention. In order to enhance its convergence rate and prevent it from getting stuck in local optima, a novel metaheuristic has been developed in this paper, where particular characteristics of the chaos mechanism and Lévy flight are introduced to the basic framework of TLBO. The new algorithm is tested on several large-scale nonlinear benchmark functions with different characteristics and compared with other methods. Experimental results show that the proposed algorithm outperforms other algorithms and achieves a satisfactory improvement over TLBO.

scholarly journals A Modified Bat Algorithm for Solving Large-Scale Bound Constrained Global Optimization Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Wali Khan Mashwani ◽  
Ihsan Mehmood ◽  
Maharani Abu Bakar ◽  
Ismail Koçcak
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Large Scale ◽  
Impact Analysis ◽  
Optimization Problems ◽  
Bat Algorithm ◽  
Stochastic Algorithm ◽  
Optimum Solution ◽  
The Impact ◽  
Modified Bat Algorithm

In the last two decades, the field of global optimization has become very active, and, in this regard, many deterministic and stochastic algorithms were developed for solving various optimization problems. Among them, swarm intelligence (SI) is a stochastic algorithm that is more flexible and robust and has had the ability to find an optimum solution for high-dimensional optimization and search problems. SI-based algorithms are mainly inspired by the social behavior of fish schooling or bird flocking. Among the SI-based algorithms, Bat algorithm (BA) is one of the recently developed evolutionary algorithms. It employs an echolocation behavior of microbats by varying pulse rates of emission and loudness to perform their search process. In this paper, a modified Bat algorithm (MBA) is developed. The main focus of the MBA is to further enhance the exploration and exploitation search abilities of the original Bat algorithm. The performance of the modified Bat algorithm (MBA) is examined over the benchmark functions designed for evolutionary algorithms competition in the special session of 2005 IEEE Congress on Evolutionary Computation. The used benchmark functions include the unimodal, multimodal, and hybrid benchmark functions with high dimensionality. Furthermore, the impact analysis with respect to different values of temperatures is conducted by executing the proposed algorithm twenty-five times independently by using each benchmark function with different random seeds.

Feature Selection for Histopathological Image Classification using levy Flight Salp Swarm Optimizer

2019 ◽  
Vol 12 (4) ◽  
pp. 329-337 ◽  
Author(s):  
Venubabu Rachapudi ◽  
Golagani Lavanya Devi
Keyword(s):  
Feature Selection ◽  
Image Classification ◽  
Feature Selection Method ◽  
Selection Method ◽  
Lévy Flight ◽  
Levy Flight ◽  
Local Optima ◽  
Histopathological Image ◽  
Surf Features ◽  
Histopathological Image Classification

Background: An efficient feature selection method for Histopathological image classification plays an important role to eliminate irrelevant and redundant features. Therefore, this paper proposes a new levy flight salp swarm optimizer based feature selection method. Methods: The proposed levy flight salp swarm optimizer based feature selection method uses the levy flight steps for each follower salp to deviate them from local optima. The best solution returns the relevant and non-redundant features, which are fed to different classifiers for efficient and robust image classification. Results: The efficiency of the proposed levy flight salp swarm optimizer has been verified on 20 benchmark functions. The anticipated scheme beats the other considered meta-heuristic approaches. Furthermore, the anticipated feature selection method has shown better reduction in SURF features than other considered methods and performed well for histopathological image classification. Conclusion: This paper proposes an efficient levy flight salp Swarm Optimizer by modifying the step size of follower salp. The proposed modification reduces the chances of sticking into local optima. Furthermore, levy flight salp Swarm Optimizer has been utilized in the selection of optimum features from SURF features for the histopathological image classification. The simulation results validate that proposed method provides optimal values and high classification performance in comparison to other methods.

An improved sparrow search algorithm based on levy flight and opposition-based learning

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Danni Chen ◽  
JianDong Zhao ◽  
Peng Huang ◽  
Xiongna Deng ◽  
Tingting Lu
Keyword(s):  
Parameter Optimization ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Convergence Speed ◽  
Support Vector ◽  
Lévy Flight ◽  
Levy Flight ◽  
Content Type ◽  
Opposition Based Learning

Purpose Sparrow search algorithm (SSA) is a novel global optimization method, but it is easy to fall into local optimization, which leads to its poor search accuracy and stability. The purpose of this study is to propose an improved SSA algorithm, called levy flight and opposition-based learning (LOSSA), based on LOSSA strategy. The LOSSA shows better search accuracy, faster convergence speed and stronger stability. Design/methodology/approach To further enhance the optimization performance of the algorithm, The Levy flight operation is introduced into the producers search process of the original SSA to enhance the ability of the algorithm to jump out of the local optimum. The opposition-based learning strategy generates better solutions for SSA, which is beneficial to accelerate the convergence speed of the algorithm. On the one hand, the performance of the LOSSA is evaluated by a set of numerical experiments based on classical benchmark functions. On the other hand, the hyper-parameter optimization problem of the Support Vector Machine (SVM) is also used to test the ability of LOSSA to solve practical problems. Findings First of all, the effectiveness of the two improved methods is verified by Wilcoxon signed rank test. Second, the statistical results of the numerical experiment show the significant improvement of the LOSSA compared with the original algorithm and other natural heuristic algorithms. Finally, the feasibility and effectiveness of the LOSSA in solving the hyper-parameter optimization problem of machine learning algorithms are demonstrated. Originality/value An improved SSA based on LOSSA is proposed in this paper. The experimental results show that the overall performance of the LOSSA is satisfactory. Compared with the SSA and other natural heuristic algorithms, the LOSSA shows better search accuracy, faster convergence speed and stronger stability. Moreover, the LOSSA also showed great optimization performance in the hyper-parameter optimization of the SVM model.

Solving Mono- and Multi-Objective Problems Using Hybrid Evolutionary Algorithms and Nelder-Mead Method

2021 ◽  
Vol 12 (4) ◽  
pp. 98-116
Author(s):  
Noureddine Boukhari ◽  
Fatima Debbat ◽  
Nicolas Monmarché ◽  
Mohamed Slimane
Keyword(s):  
Convergence Rate ◽  
Optimization Problem ◽  
Optimization Problems ◽  
State Of The Art ◽  
Hybrid Approach ◽  
Optimization Methods ◽  
Global Optimum ◽  
Stochastic Methods ◽  
Local Optima ◽  
Portfolio Optimization Problem

Evolution strategies (ES) are a family of strong stochastic methods for global optimization and have proved their capability in avoiding local optima more than other optimization methods. Many researchers have investigated different versions of the original evolution strategy with good results in a variety of optimization problems. However, the convergence rate of the algorithm to the global optimum stays asymptotic. In order to accelerate the convergence rate, a hybrid approach is proposed using the nonlinear simplex method (Nelder-Mead) and an adaptive scheme to control the local search application, and the authors demonstrate that such combination yields significantly better convergence. The new proposed method has been tested on 15 complex benchmark functions and applied to the bi-objective portfolio optimization problem and compared with other state-of-the-art techniques. Experimental results show that the performance is improved by this hybridization in terms of solution eminence and strong convergence.

Sign in / Sign up

Export Citation Format

Share Document