Enhancing Feature Selection Accuracy using Butterfly and Lion Optimization Algorithm with Specific Reference to Psychiatric Disorder Detection & Diagnosis

As the complexity of medical computing increases the use of intelligent methods based on methods of soft computing also increases. During current decade this intelligent computing involves various meta-heuristic algorithms for Optimization. Many new meta-heuristic algorithms are proposed in last few years. The dimension of this data has also wide. Feature selection processes play an important role in these types of wide data. In intelligent computation feature selection is important phase after the pre-processing phase. The success of any model depends on how better optimization algorithms is used. Sometime single optimization algorithms are not enough in order to produce better result. In this paper meta-heuristic algorithm like butterfly optimization algorithm and enhanced lion optimization algorithm are used to show better accuracy in feature selection. The study focuses on nature based integrated meta-heuristic algorithm like Butterfly Optimization and lion-based optimization. Also, in this paper various other Optimization algorithms are analyzed. The study shows how integrated methods are useful to enhance the accuracy of any computing model to solve Complex problems. Here experimental result has shown by proposing and hybrid model for two major psychiatric disorders one is known as autism spectrum and second one is Parkinson's disease

Comparative study between metaheuristic algorithms for internet of things wireless nodes localization

Wireless networks are currently used in a wide range of healthcare, military, or environmental applications. Wireless networks contain many nodes and sensors that have many limitations, including limited power, limited processing, and narrow range. Therefore, determining the coordinates of the location of a node of the unknown location at a low cost and a limited treatment is one of the most important challenges facing this field. There are many meta-heuristic algorithms that help in identifying unknown nodes for some known nodes. In this manuscript, hybrid metaheuristic optimization algorithms such as grey wolf optimization and salp swarm algorithm are used to solve localization problem of internet of things (IoT) sensors. Several experiments are conducted on every meta-heuristic optimization algorithm to compare them with the proposed method. The proposed algorithm achieved high accuracy with low error rate (0.001) and low power consumption

Path-planning in 3D space using butterfly optimization algorithm

The Butterfly Optimization Algorithm is one of the most recent nature-inspired algorithms that mimic the butterflies' behavior in mating and finding food, for solving the global optimization problems. The algorithm utilizes the sense of butterflies of smelling for determining the location of nectar and find mates, which is based on the foraging strategy of those insects. This paper represents a method of using the BOA algorithm for solving the problem of path planning in three-dimensional space. The proposed method finds a path from a particular starting point to any chosen goal, where the generated final path is completely safe and collision-free. The algorithm is based on 3 phases: the initial phase, the iteration phase, and the final phase. The movement of butterflies is based on two search moves, one of them is Local random search; where the butterfly moves randomly within the swarm, and the other is Global search; where the butterfly moves towards the best-fitted butterfly in the current population. The proposed method in this paper is able to find a collision-free path from the start point to the goal in all of the presented test environments in proximately well performance and the results were computed in terms of execution time and path length

Multi-criteria decision making monarch butterfly optimization for optimal distributed energy resources mix in distribution networks

The optimal integration of distributed energy resources (DERs) is a multiobjective and complex combinatorial optimization problem that conventional optimization methods cannot solve efficiently. This paper reviews the existing DER integration models, optimization and multi-criteria decision-making approaches. Further to that, a recently developed monarch butterfly optimization method is introduced to solve the problem of DER mix in distribution systems. A new multiobjective DER integration problem is formulated to find the optimal sites, sizes and mix (dispatchable and non-dispatchable) for DERs considering multiple key performance objectives. Besides, a hybrid method that combines the monarch butterfly optimization and the technique for order of preference by similarity to ideal solution (TOPSIS) is proposed to solve the formulated large-scale multi-criteria decision-making problem. Whilst the meta-heuristic optimization method generates non-dominated solutions (creating Pareto-front), the TOPSIS approach selects that with the most promising outcome from a large number of alternatives. The effectiveness of this approach is verified by solving single and multiobjective dispatchable DER integration problems over the benchmark 33-bus distribution system and the performance is compared with the existing optimization methods. The proposed model of DER mix and the optimization technique significantly improve the system performance in terms of average annual energy loss reduction by 78.36%, mean node voltage deviation improvement by 9.59% and average branches loadability limits enhancement by 50%, and minimized the power fluctuation induced by 48.39% renewable penetration. The proposed optimization techniques outperform the existing methods with promising exploration and exploitation abilities to solve engineering optimization problems

Improved Reptile Search Optimization Algorithm using Chaotic map and Simulated Annealing for Feature Selection in Medical Filed

The increased volume of medical datasets has produced high dimensional features, negatively affecting machine learning (ML) classifiers. In ML, the feature selection process is fundamental for selecting the most relevant features and reducing redundant and irrelevant ones. The optimization algorithms demonstrate its capability to solve feature selection problems. Reptile Search Algorithm (RSA) is a new nature-inspired optimization algorithm that stimulates Crocodiles’ encircling and hunting behavior. The unique search of the RSA algorithm obtains promising results compared to other optimization algorithms. However, when applied to high-dimensional feature selection problems, RSA suffers from population diversity and local optima limitations. An improved metaheuristic optimizer, namely the Improved Reptile Search Algorithm (IRSA), is proposed to overcome these limitations and adapt the RSA to solve the feature selection problem. Two main improvements adding value to the standard RSA; the first improvement is to apply the chaos theory at the initialization phase of RSA to enhance its exploration capabilities in the search space. The second improvement is to combine the Simulated Annealing (SA) algorithm with the exploitation search to avoid the local optima problem. The IRSA performance was evaluated over 20 medical benchmark datasets from the UCI machine learning repository. Also, IRSA is compared with the standard RSA and state-of-the-art optimization algorithms, including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Grasshopper Optimization algorithm (GOA) and Slime Mould Optimization (SMO). The evaluation metrics include the number of selected features, classification accuracy, fitness value, Wilcoxon statistical test (p-value), and convergence curve. Based on the results obtained, IRSA confirmed its superiority over the original RSA algorithm and other optimized algorithms on the majority of the medical datasets

Hybrid Artificial Bee Colony and Improved Simulated Annealing for the Capacitated Vehicle Routing Problem

Capacitated Vehicle Routing Problem (CVRP) is a type of NP-Hard combinatorial problem that requires a high computational process. In the case of CVRP, there is an additional constraint in the form of a capacity limit owned by the vehicle, so the complexity of the problem from CVRP is to find the optimum route pattern for minimizing travel costs which are also adjusted to customer demand and vehicle capacity for distribution. One method of solving CVRP can be done by implementing a meta-heuristic algorithm. In this research, two meta-heuristic algorithms have been hybridized: Artificial Bee Colony (ABC) with Improved Simulated Annealing (SA). The motivation behind this idea is to complete the excess and the lack of two algorithms when exploring and exploiting the optimal solution. Hybridization is done by running the ABC algorithm, and then the output solution at this stage will be used as an initial solution for the Improved SA method. Parameter testing for both methods has been carried out to produce an optimal solution. In this study, the test was carried out using the CVRP benchmark dataset generated by Augerat (Dataset 1) and the recent CVRP dataset from Uchoa (Dataset 2). The result shows that hybridizing the ABC algorithm and Improved SA could provide a better solution than the basic ABC without hybridization