5 research outputs found

    An improved grey wolf with whale algorithm for optimization functions

    Get PDF
    The Grey Wolf Optimization (GWO) is a nature-inspired, meta-heuristic search optimization algorithm. It follows the social hierarchical structure of a wolf pack and their ability to hunt in packs. Since its inception in 2014, GWO is able to successfully solve several optimization problems and has shown better convergence than the Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Differential Evolution (DE), and Evolutionary Programming (EP). Despite providing successful solutions to optimization problems, GWO has an inherent problem of poor exploration capability. The position-update equation in GWO mostly relies on the information provided by the previous solutions to generate new candidate solutions which result in poor exploration activity. Therefore, to overcome the problem of poor exploration in the GWO the exploration part of the Whale optimization algorithm (WOA) is integrated in it. The resultant Grey Wolf Whale Optimization Algorithm (GWWOA) offers better exploration ability and is able to solve the optimization problems to find the most optimal solution in search space. The performance of the proposed algorithm is tested and evaluated on five benchmarked unimodal and five multimodal functions. The simulation results show that the proposed GWWOA is able to find a fine balance between exploration and exploitation capabilities during convergence to global minima as compared to the standard GWO and WOA algorithms

    Enhanced grey wolf optimisation algorithm for feature selection in anomaly detection

    Get PDF
    Anomaly detection deals with identification of items that do not conform to an expected pattern or items present in a dataset. The performance of different mechanisms utilized to perform the anomaly detection depends heavily on the group of features used. Thus, not all features in the dataset can be used in the classification process since some features may lead to low performance of classifier. Feature selection (FS) is a good mechanism that minimises the dimension of high-dimensional datasets by deleting the irrelevant features. Modified Binary Grey Wolf Optimiser (MBGWO) is a modern metaheuristic algorithm that has successfully been used for FS for anomaly detection. However, the MBGWO has several issues in finding a good quality solution. Thus, this study proposes an enhanced binary grey wolf optimiser (EBGWO) algorithm for FS in anomaly detection to overcome the algorithm issues. The first modification enhances the initial population of the MBGWO using a heuristic based Ant Colony Optimisation algorithm. The second modification develops a new position update mechanism using the Bat Algorithm movement. The third modification improves the controlled parameter of the MBGWO algorithm using indicators from the search process to refine the solution. The EBGWO algorithm was evaluated on NSL-KDD and six (6) benchmark datasets from the University California Irvine (UCI) repository against ten (10) benchmark metaheuristic algorithms. Experimental results of the EBGWO algorithm on the NSL-KDD dataset in terms of number of selected features and classification accuracy are superior to other benchmark optimisation algorithms. Moreover, experiments on the six (6) UCI datasets showed that the EBGWO algorithm is superior to the benchmark algorithms in terms of classification accuracy and second best for the number of selected features. The proposed EBGWO algorithm can be used for FS in anomaly detection tasks that involve any dataset size from various application domains

    A New Hybrid Algorithm Based on Grey Wolf Optimization and Crow Search Algorithm for Unconstrained Function Optimization and Feature Selection

    No full text

    A New Enhanced Hybrid Grey Wolf Optimizer (GWO) Combined with Elephant Herding Optimization (EHO) Algorithm for Engineering Optimization

    Get PDF
    Although the exploitation of GWO advances sharply, it has limitations for continuous implementing exploration. On the other hand, the EHO algorithm easily has shown its capability to prevent local optima. For hybridization and by considering the advantages of GWO and the abilities of EHO, it would be impressive to combine these two algorithms. In this respect, the exploitation and exploration performances and the convergence speed of the GWO algorithm are improved by combining it with the EHO algorithm. Therefore, this paper proposes a new hybrid Grey Wolf Optimizer (GWO) combined with Elephant Herding Optimization (EHO) algorithm. Twenty-three benchmark mathematical optimization challenges and six constrained engineering challenges are used to validate the performance of the suggested GWOEHO compared to both the original GWO and EHO algorithms and some other well-known optimization algorithms. Wilcoxon's rank-sum test outcomes revealed that GWOEHO outperforms others in most function minimization. The results also proved that the convergence speed of GWOEHO is faster than the original algorithms
    corecore