Real-world problems are complex as they are multidimensional and multimodal in nature that encourages computer scientists to develop better and efficient problem-solving methods. Nature-inspired metaheuristics have shown better performances than that of traditional approaches. Till date, researchers have presented and experimented with various nature-inspired metaheuristic algorithms to handle various search problems. This paper introduces a new nature-inspired algorithm, namely butterfly optimization algorithm (BOA) that mimics food search and mating behavior of butterflies, to solve global optimization problems. The framework is mainly based on the foraging strategy of butterflies, which utilize their sense of smell to determine the location of nectar or mating partner. In this paper, the proposed algorithm is tested and validated on a set of 30 benchmark test functions and its performance is compared with other metaheuristic algorithms. BOA is also employed to solve three classical engineering problems (spring design, welded beam design, and gear train design). Results indicate that the proposed BOA is more efficient than other metaheuristic algorithms.

Butterfly optimization algorithm: a novel approach for global optimization

A survey on new generation metaheuristic algorithms

In this article, an Improved Grey Wolf Optimizer (I-GWO) is proposed for solving global optimization and engineering design problems. This improvement is proposed to alleviate the lack of population diversity, the imbalance between the exploitation and exploration, and premature convergence of the GWO algorithm. The I-GWO algorithm benefits from a new movement strategy named dimension learning-based hunting (DLH) search strategy inherited from the individual hunting behavior of wolves in nature. DLH uses a different approach to construct a neighborhood for each wolf in which the neighboring information can be shared between wolves. This dimension learning used in the DLH search strategy enhances the balance between local and global search and maintains diversity. The performance of the proposed I-GWO algorithm is evaluated on the CEC 2018 benchmark suite and four engineering problems. In all experiments, I-GWO is compared with six other state-of-the-art metaheuristics. The results are also analyzed by Friedman and MAE statistical tests. The experimental results and statistical tests demonstrate that the I-GWO algorithm is very competitive and often superior compared to the algorithms used in the experiments. The results of the proposed algorithm on the engineering design problems demonstrate its efficiency and applicability.

An improved grey wolf optimizer for solving engineering problems

Chaotic whale optimization algorithm

Whale Optimization Algorithm (WOA) is an optimization algorithm developed by Mirjalili and Lewis in 2016. An overview of WOA is described in this paper, rooted from the bubble-net hunting strategy, besides an overview of WOA applications that are used to solve optimization problems in various categories. The best solution has been determined to make something as functional and effective as possible through the optimization process by minimizing or maximizing the parameters involved in the problems. Research and engineering attention have been paid to Meta-heuristics for purposes of decision-making given the growing complexity of models and the needs for quick decision making in the engineering. An updated review of research of WOA is provided in this paper for hybridization, improved, and variants. The categories included in the reviews are Engineering, Clustering, Classification, Robot Path, Image Processing, Networks, Task Scheduling, and other engineering applications. According to the reviewed literature, WOA is mostly used in the engineering area to solve optimization problems. Providing an overview and summarizing the review of WOA applications are the aims of this paper.

A comprehensive survey: Whale Optimization Algorithm and its applications

Chaotic grey wolf optimization algorithm for constrained optimization problems

In this paper, binary variants of the Butterfly Optimization Algorithm (BOA) are proposed and used to select the optimal feature subset for classification purposes in a wrapper-mode. BOA is a recently proposed algorithm that has not been systematically applied to feature selection problems yet. BOA can efficiently explore the feature space for optimal or near-optimal feature subset minimizing a given fitness function. The two proposed binary variants of BOA are applied to select the optimal feature combination that maximizes classification accuracy while minimizing the number of selected features. In these variants, the native BOA is utilized while its continuous steps are bounded in a threshold using a suitable threshold function after squashing them. The proposed binary algorithms are compared with five state-of-the-art approaches and four latest high performing optimization algorithms. A number of assessment indicators are utilized to properly assess and compare the performance of these algorithms over 21 datasets from the UCI repository. The experimental results confirm the efficiency of the proposed approaches in improving the classification accuracy compared to other wrapper-based algorithms, which proves the ability of BOA algorithm in searching the feature space and selecting the most informative attributes for classification tasks.

Binary butterfly optimization approaches for feature selection

Grasshopper optimization algorithm (GOA) is a new meta-heuristic algorithm inspired by the swarming behavior of grasshoppers. The present study introduces chaos theory into the optimization process of GOA so as to accelerate its global convergence speed. The chaotic maps are employed to balance the exploration and exploitation efficiently and the reduction in repulsion/attraction forces between grasshoppers in the optimization process. The proposed chaotic GOA algorithms are benchmarked on thirteen test functions. The results show that the chaotic maps (especially circle map) are able to significantly boost the performance of GOA.

Sankalap Arora

Papers

Butterfly optimization algorithm: a novel approach for global optimization

Chaotic whale optimization algorithm

Chaotic grey wolf optimization algorithm for constrained optimization problems

Binary butterfly optimization approaches for feature selection

Chaotic grasshopper optimization algorithm for global optimization