scholarly journals Grey Wolf Optimizer Based on Powell Local Optimization Method for Clustering Analysis

2015 ◽  
Vol 2015 ◽  
pp. 1-17 ◽  
Author(s):  
Sen Zhang ◽  
Yongquan Zhou
Keyword(s):  
Data Clustering ◽  
Optimization Problems ◽  
Optimization Method ◽  
Local Optimization ◽  
Superior Performance ◽  
Grey Wolf Optimizer ◽  
Data Sets ◽  
Grey Wolf ◽  
Data Mining Technique ◽  
Local Optimization Method

One heuristic evolutionary algorithm recently proposed is the grey wolf optimizer (GWO), inspired by the leadership hierarchy and hunting mechanism of grey wolves in nature. This paper presents an extended GWO algorithm based on Powell local optimization method, and we call it PGWO. PGWO algorithm significantly improves the original GWO in solving complex optimization problems. Clustering is a popular data analysis and data mining technique. Hence, the PGWO could be applied in solving clustering problems. In this study, first the PGWO algorithm is tested on seven benchmark functions. Second, the PGWO algorithm is used for data clustering on nine data sets. Compared to other state-of-the-art evolutionary algorithms, the results of benchmark and data clustering demonstrate the superior performance of PGWO algorithm.

scholarly journals A Novel Hybrid Algorithm Based on Grey Wolf Optimizer and Fireworks Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2147 ◽  
Author(s):  
Zhihang Yue ◽  
Sen Zhang ◽  
Wendong Xiao
Keyword(s):  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Optimization Method ◽  
Grey Wolf Optimizer ◽  
Local Optimum ◽  
Grey Wolf ◽  
Optimal Search ◽  
Fireworks Algorithm ◽  
Wide Range ◽  
Search Capability

Grey wolf optimizer (GWO) is a meta-heuristic algorithm inspired by the hierarchy of grey wolves (Canis lupus). Fireworks algorithm (FWA) is a nature-inspired optimization method mimicking the explosion process of fireworks for optimization problems. Both of them have a strong optimal search capability. However, in some cases, GWO converges to the local optimum and FWA converges slowly. In this paper, a new hybrid algorithm (named as FWGWO) is proposed, which fuses the advantages of these two algorithms to achieve global optima effectively. The proposed algorithm combines the exploration ability of the fireworks algorithm with the exploitation ability of the grey wolf optimizer (GWO) by setting a balance coefficient. In order to test the competence of the proposed hybrid FWGWO, 16 well-known benchmark functions having a wide range of dimensions and varied complexities are used in this paper. The results of the proposed FWGWO are compared to nine other algorithms, including the standard FWA, the native GWO, enhanced grey wolf optimizer (EGWO), and augmented grey wolf optimizer (AGWO). The experimental results show that the FWGWO effectively improves the global optimal search capability and convergence speed of the GWO and FWA.

scholarly journals On the application of nature-inspired grey wolf optimizer algorithm in geodesy

2020 ◽  
Vol 10 (1) ◽  
pp. 48-52
Author(s):  
M. Yetkin ◽  
O. Bilginer
Keyword(s):  
Optimization Problems ◽  
Optimization Method ◽  
Population Based ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
Absolute Value ◽  
Robust Parameter ◽  
First Time ◽  
Electronic Distance Measurement

AbstractNowadays, solving hard optimization problems using metaheuristic algorithms has attracted bountiful attention. Generally, these algorithms are inspired by natural metaphors. A novel metaheuristic algorithm, namely Grey Wolf Optimization (GWO), might be applied in the solution of geodetic optimization problems. The GWO algorithm is based on the intelligent behaviors of grey wolves and a population based stochastic optimization method. One great advantage of GWO is that there are fewer control parameters to adjust. The algorithm mimics the leadership hierarchy and hunting mechanism of grey wolves in nature. In the present paper, the GWO algorithm is applied in the calibration of an Electronic Distance Measurement (EDM) instrument using the Least Squares (LS) principle for the first time. Furthermore, a robust parameter estimator called the Least Trimmed Absolute Value (LTAV) is applied to a leveling network for the first time. The GWO algorithm is used as a computing tool in the implementation of robust estimation. The results obtained by GWO are compared with the results of the ordinary LS method. The results reveal that the use of GWO may provide efficient results compared to the classical approach.

scholarly journals Ls-II: An Improved Locust Search Algorithm for Solving Optimization Problems

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Octavio Camarena ◽  
Erik Cuevas ◽  
Marco Pérez-Cisneros ◽  
Fernando Fausto ◽  
Adrián González ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Search Space ◽  
Optimization Method ◽  
Superior Performance ◽  
Solution Quality ◽  
Original Algorithm ◽  
Motion Models ◽  
Search Mechanism ◽  
Solitary Phase

The Locust Search (LS) algorithm is a swarm-based optimization method inspired in the natural behavior of the desert locust. LS considers the inclusion of two distinctive nature-inspired search mechanism, namely, their solitary phase and social phase operators. These interesting search schemes allow LS to overcome some of the difficulties that commonly affect other similar methods, such as premature convergence and the lack of diversity on solutions. Recently, computer vision experiments in insect tracking methods have conducted to the development of more accurate locust motion models than those produced by simple behavior observations. The most distinctive characteristic of such new models is the use of probabilities to emulate the locust decision process. In this paper, a modification to the original LS algorithm, referred to as LS-II, is proposed to better handle global optimization problems. In LS-II, the locust motion model of the original algorithm is modified incorporating the main characteristics of the new biological formulations. As a result, LS-II improves its original capacities of exploration and exploitation of the search space. In order to test its performance, the proposed LS-II method is compared against several the state-of-the-art evolutionary methods considering a set of benchmark functions and engineering problems. Experimental results demonstrate the superior performance of the proposed approach in terms of solution quality and robustness.

scholarly journals An Improved Grey Wolf Optimizer for a Supplier Selection and Order Quantity Allocation Problem

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1457
Author(s):  
Avelina Alejo-Reyes ◽  
Erik Cuevas ◽  
Alma Rodríguez ◽  
Abraham Mendoza ◽  
Elias Olivares-Benitez
Keyword(s):  
Supplier Selection ◽  
Search Strategy ◽  
Optimization Problems ◽  
Displacement Vector ◽  
Optimal Solution ◽  
Optimization Techniques ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Order Quantity ◽  
Hunting Behavior

Supplier selection and order quantity allocation have a strong influence on a company’s profitability and the total cost of finished products. From an optimization perspective, the processes of selecting the right suppliers and allocating orders are modeled through a cost function that considers different elements, such as the price of raw materials, ordering costs, and holding costs. Obtaining the optimal solution for these models represents a complex problem due to their discontinuity, non-linearity, and high multi-modality. Under such conditions, it is not possible to use classical optimization methods. On the other hand, metaheuristic schemes have been extensively employed as alternative optimization techniques to solve difficult problems. Among the metaheuristic computation algorithms, the Grey Wolf Optimization (GWO) algorithm corresponds to a relatively new technique based on the hunting behavior of wolves. Even though GWO allows obtaining satisfying results, its limited exploration reduces its performance significantly when it faces high multi-modal and discontinuous cost functions. In this paper, a modified version of the GWO scheme is introduced to solve the complex optimization problems of supplier selection and order quantity allocation. The improved GWO method called iGWO includes weighted factors and a displacement vector to promote the exploration of the search strategy, avoiding the use of unfeasible solutions. In order to evaluate its performance, the proposed algorithm has been tested on a number of instances of a difficult problem found in the literature. The results show that the proposed algorithm not only obtains the optimal cost solutions, but also maintains a better search strategy, finding feasible solutions in all instances.

EKEGWO: Enhanced Kernel-Based Exponential Grey Wolf Optimizer for Bi-Objective Data Clustering

2019 ◽  
Vol 27 (04) ◽  
pp. 669-688 ◽  
Author(s):  
Amolkumar Narayan Jadhav ◽  
Gomathi N.
Keyword(s):  
Data Clustering ◽  
Clustering Algorithm ◽  
Fitness Function ◽  
Multidimensional Data ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Widespread Application ◽  
Clustering Techniques ◽  
Cluster Distance ◽  
F Measure

The widespread application of clustering in various fields leads to the discovery of different clustering techniques in order to partition multidimensional data into separable clusters. Although there are various clustering approaches used in literature, optimized clustering techniques with multi-objective consideration are rare. This paper proposes a novel data clustering algorithm, Enhanced Kernel-based Exponential Grey Wolf Optimization (EKEGWO), handling two objectives. EKEGWO, which is the extension of KEGWO, adopts weight exponential functions to improve the searching process of clustering. Moreover, the fitness function of the algorithm includes intra-cluster distance and the inter-cluster distance as an objective to provide an optimum selection of cluster centroids. The performance of the proposed technique is evaluated by comparing with the existing approaches PSC, mPSC, GWO, and EGWO for two datasets: banknote authentication and iris. Four metrics, Mean Square Error (MSE), F-measure, rand and jaccord coefficient, estimates the clustering efficiency of the algorithm. The proposed EKEGWO algorithm can attain an MSE of 837, F-measure of 0.9657, rand coefficient of 0.8472, jaccord coefficient of 0.7812, for the banknote dataset.

scholarly journals Multi-objective Informative Frequency Band Selection Based on Negentropy-induced Grey Wolf Optimizer for Fault Diagnosis of Rolling Element Bearings

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 1845 ◽  
Author(s):  
Xiaohui Gu ◽  
Shaopu Yang ◽  
Yongqiang Liu ◽  
Rujiang Hao ◽  
Zechao Liu
Keyword(s):  
Frequency Band ◽  
Background Noise ◽  
Grey Wolf Optimizer ◽  
Data Sets ◽  
Rolling Element Bearings ◽  
Grey Wolf ◽  
Objective Functions ◽  
Multi Objective ◽  
Rolling Element ◽  
Envelope Spectrum

Informative frequency band (IFB) selection is a challenging task in envelope analysis for the localized fault detection of rolling element bearings. In previous studies, it was often conducted with a single indicator, such as kurtosis, etc., to guide the automatic selection. However, in some cases, it is difficult for that to fully depict and balance the fault characters from impulsiveness and cyclostationarity of the repetitive transients. To solve this problem, a novel negentropy-induced multi-objective optimized wavelet filter is proposed in this paper. The wavelet parameters are determined by a grey wolf optimizer with two independent objective functions i.e., maximizing the negentropy of squared envelope and squared envelope spectrum to capture impulsiveness and cyclostationarity, respectively. Subsequently, the average negentropy is utilized in identifying the IFB from the obtained Pareto set, which are non-dominated by other solutions to balance the impulsive and cyclostationary features and eliminate the background noise. Two cases of real vibration signals with slight bearing faults are applied in order to evaluate the performance of the proposed methodology, and the results demonstrate its effectiveness over some fast and optimal filtering methods. In addition, its stability in tracking the IFB is also tested by a case of condition monitoring data sets.

Sign in / Sign up

Export Citation Format

Share Document