scholarly journals Bat algorithm (BA): review, applications and modifications

2020 ◽  
Vol 8 (1) ◽  
pp. 1
Author(s):  
Amar Yahya Zebari ◽  
Saman M. Almufti ◽  
Chyavan Mohammed Abdulrahman
Keyword(s):  
Emission Rate ◽  
Optimization Problems ◽  
Bat Algorithm ◽  
Search Process ◽  
Metaheuristic Algorithm ◽  
Swarm Optimization ◽  
Timely Review ◽  
Wide Range ◽  
Discrete Spaces ◽  
Almost All

Generally, Metaheuristic algorithms such as ant colony optimization, Elephant herding algorithm, particle swarm optimization, bat algorithms becomes a powerful methods for solving optimization problems. This paper provides a timely review of the bat algorithm and its new variants.Bat algorithm (BA) is a Swarm based metaheuristic algorithm developed in 2010 by Xin-She Yang, BA has been inspired by the foraging behavior of micro bats, algorithm carries out the search process using artificial bats as search agents mimicking the natural pulse loudness and emission rate of real bats. It has become a powerful swarm intelligence method for solving optimization prob-lems over continuous and discrete spaces. Nowadays, it has been successfully applied to solve problems in almost all areas of opti-mization, and it found to be very efficient. As a result, the literature has expanded significantly, a wide range of diverse applications and case studies has been made base on the bat algorithm. 

scholarly journals A Modified NM-PSO Method for Parameter Estimation Problems of Models

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
An Liu ◽  
Erwie Zahara ◽  
Ming-Ta Yang
Keyword(s):  
Genetic Algorithm ◽  
Parameter Estimation ◽  
Particle Swarm Optimization ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Wide Range ◽  
Estimation Problems

Ordinary differential equations usefully describe the behavior of a wide range of dynamic physical systems. The particle swarm optimization (PSO) method has been considered an effective tool for solving the engineering optimization problems for ordinary differential equations. This paper proposes a modified hybrid Nelder-Mead simplex search and particle swarm optimization (M-NM-PSO) method for solving parameter estimation problems. The M-NM-PSO method improves the efficiency of the PSO method and the conventional NM-PSO method by rapid convergence and better objective function value. Studies are made for three well-known cases, and the solutions of the M-NM-PSO method are compared with those by other methods published in the literature. The results demonstrate that the proposed M-NM-PSO method yields better estimation results than those obtained by the genetic algorithm, the modified genetic algorithm (real-coded GA (RCGA)), the conventional particle swarm optimization (PSO) method, and the conventional NM-PSO method.

An Efficient Chaotic Salp Swarm Optimization Approach Based on Ensemble Algorithm for Solving Class Imbalance Problem

2021 ◽  
Author(s):  
Rekha G ◽  
Krishna Reddy V ◽  
chandrashekar jatoth ◽  
Ugo Fiore
Keyword(s):  
Feature Selection ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Fitness Function ◽  
Class Imbalance ◽  
Optimization Approach ◽  
Class Imbalance Problem ◽  
Swarm Optimization ◽  
Adaboost Algorithm ◽  
Wide Range

Abstract Class imbalance problems have attracted the research community but a few works have focused on feature selection with imbalanced datasets. To handle class imbalance problems, we developed a novel fitness function for feature selection using the chaotic salp swarm optimization algorithm, an efficient meta-heuristic optimization algorithm that has been successfully used in a wide range of optimization problems. This paper proposes an Adaboost algorithm with chaotic salp swarm optimization. The most discriminating features are selected using salp swarm optimization and Adaboost classifiers are thereafter trained on the features selected. Experiments show the ability of the proposed technique to find the optimal features with performance maximization of Adaboost.

Evolving Particle Swarm Optimization Implemented by a Genetic Algorithm

2008 ◽  
Vol 12 (3) ◽  
pp. 284-289 ◽  
Author(s):  
Jenn-Long Liu ◽  
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Social Learning ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Search Space ◽  
Design Parameters ◽  
Search Process ◽  
Swarm Optimization ◽  
Learning Rates

Particle swarm optimization (PSO) is a promising evolutionary approach related to a particle moves over the search space with velocity, which is adjusted according to the flying experiences of the particle and its neighbors, and flies towards the better and better search area over the course of search process. Although the PSO is effective in solving the global optimization problems, there are some crucial user-input parameters, such as cognitive and social learning rates, affect the performance of algorithm since the search process of a PSO algorithm is nonlinear and complex. Consequently, a PSO with well-selected parameter settings may result in good performance. This work develops an evolving PSO based on the Clerc’s PSO to evaluate the fitness of objective function and a genetic algorithm (GA) to evolve the optimal design parameters to provide the usage of PSO. The crucial design parameters studied herein include the cognitive and social learning rates as well as constriction factor for the Clerc’s PSO. Several benchmarking cases are experimented to generalize a set of optimal parameters via the evolving PSO. Furthermore, the better parameters are applied to the engineering optimization of a pressure vessel design.

scholarly journals Improved Barebones Particle Swarm Optimization with Neighborhood Search and Its Application on Ship Design

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Jingzheng Yao ◽  
Duanfeng Han
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Ship Design ◽  
Neighborhood Search ◽  
Search Process ◽  
Exploration And Exploitation ◽  
Swarm Optimization ◽  
Real World Problem ◽  
Complex Optimization

Barebones particle swarm optimization (BPSO) is a new PSO variant, which has shown a good performance on many optimization problems. However, similar to the standard PSO, BPSO also suffers from premature convergence when solving complex optimization problems. In order to improve the performance of BPSO, this paper proposes a new BPSO variant called BPSO with neighborhood search (NSBPSO) to achieve a tradeoff between exploration and exploitation during the search process. Experiments are conducted on twelve benchmark functions and a real-world problem of ship design. Simulation results demonstrate that our approach outperforms the standard PSO, BPSO, and six other improved PSO algorithms.

Comparison of Selected Swarm Intelligence Algorithms in Student Courses Recommendation Application

2014 ◽  
Vol 24 (01) ◽  
pp. 91-109 ◽  
Author(s):  
Janusz Sobecki
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Optimization Problems ◽  
Bat Algorithm ◽  
Problem Space ◽  
Swarm Optimization ◽  
Bee Colony ◽  
Grade Prediction ◽  
Bee Colony Optimization ◽  
Swarm Intelligence Algorithm

In this paper a comparison of a few swarm intelligence algorithms applied in recommendation of student courses is presented. Swarm intelligence algorithms are nowadays successfully used in many areas, especially in optimization problems. To apply each swarm intelligence algorithm in recommender systems a special representation of the problem space is necessary. Here we present the comparison of efficiency of grade prediction of several evolutionary algorithms, such as: Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Intelligent Weed Optimization (IWO), Bee Colony Optimization (BCO) and Bat Algorithm (BA).

scholarly journals Repulsive Self-Adaptive Acceleration Particle Swarm Optimization Approach

2014 ◽  
Vol 4 (3) ◽  
pp. 189-204 ◽  
Author(s):  
Simone A. Ludwig
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Main Idea ◽  
Benchmark Problems ◽  
Optimization Approach ◽  
Swarm Optimization ◽  
Wide Range ◽  
Adaptive Pso ◽  
Self Adaptive

Abstract Adaptive Particle Swarm Optimization (PSO) variants have become popular in recent years. The main idea of these adaptive PSO variants is that they adaptively change their search behavior during the optimization process based on information gathered during the run. Adaptive PSO variants have shown to be able to solve a wide range of difficult optimization problems efficiently and effectively. In this paper we propose a Repulsive Self-adaptive Acceleration PSO (RSAPSO) variant that adaptively optimizes the velocity weights of every particle at every iteration. The velocity weights include the acceleration constants as well as the inertia weight that are responsible for the balance between exploration and exploitation. Our proposed RSAPSO variant optimizes the velocity weights that are then used to search for the optimal solution of the problem (e.g., benchmark function). We compare RSAPSO to four known adaptive PSO variants (decreasing weight PSO, time-varying acceleration coefficients PSO, guaranteed convergence PSO, and attractive and repulsive PSO) on twenty benchmark problems. The results show that RSAPSO achives better results compared to the known PSO variants on difficult optimization problems that require large numbers of function evaluations.

Quantum-Behaved Bat Algorithm for Solving the Economic Load Dispatch Problem Considering a Valve-Point Effect

2021 ◽  
pp. 93-110
Author(s):  
Pandian Vasant ◽  
Fahad Parvez Mahdi ◽  
Jose Antonio Marmolejo-Saucedo ◽  
Igor Litvinchev ◽  
Roman Rodriguez Aguilar ◽  
...  
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problems ◽  
Bat Algorithm ◽  
Evolutionary Programming ◽  
Economic Load Dispatch ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Real World Problem ◽  
Valve Point Effect ◽  
Power Generation Systems

Quantum computing-inspired metaheuristic algorithms have emerged as a powerful computational tool to solve nonlinear optimization problems. In this paper, a quantum-behaved bat algorithm (QBA) is implemented to solve a nonlinear economic load dispatch (ELD) problem. The objective of ELD is to find an optimal combination of power generating units in order to minimize total fuel cost of the system, while satisfying all other constraints. To make the system more applicable to the real-world problem, a valve-point effect is considered here with the ELD problem. QBA is applied in 3-unit, 10-unit, and 40-unit power generation systems for different load demands. The obtained result is then presented and compared with some well-known methods from the literature such as different versions of evolutionary programming (EP) and particle swarm optimization (PSO), genetic algorithm (GA), differential evolution (DE), simulated annealing (SA) and hybrid ABC_PSO. The comparison of results shows that QBA performs better than the above-mentioned methods in terms of solution quality, convergence characteristics and computational efficiency. Thus, QBA proves to be an effective and a robust technique to solve such nonlinear optimization problem.

scholarly journals GPU-Based Parallel Particle Swarm Optimization Methods for Graph Drawing

2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Jianhua Qu ◽  
Xiyu Liu ◽  
Minghe Sun ◽  
Feng Qi
Keyword(s):  
Particle Swarm Optimization ◽  
Large Scale ◽  
Graph Drawing ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Population Based ◽  
Pictorial Representation ◽  
Swarm Optimization ◽  
Wide Range

Particle Swarm Optimization (PSO) is a population-based stochastic search technique for solving optimization problems, which has been proven to be effective in a wide range of applications. However, the computational efficiency on large-scale problems is still unsatisfactory. A graph drawing is a pictorial representation of the vertices and edges of a graph. Two PSO heuristic procedures, one serial and the other parallel, are developed for undirected graph drawing. Each particle corresponds to a different layout of the graph. The particle fitness is defined based on the concept of the energy in the force-directed method. The serial PSO procedure is executed on a CPU and the parallel PSO procedure is executed on a GPU. Two PSO procedures have different data structures and strategies. The performance of the proposed methods is evaluated through several different graphs. The experimental results show that the two PSO procedures are both as effective as the force-directed method, and the parallel procedure is more advantageous than the serial procedure for larger graphs.

scholarly journals The Improved Antlion Optimizer and Artificial Neural Network for Chinese Influenza Prediction

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Hongping Hu ◽  
Yangyang Li ◽  
Yanping Bai ◽  
Juping Zhang ◽  
Maoxing Liu
Keyword(s):  
Neural Network ◽  
Bp Neural Network ◽  
Optimization Problems ◽  
Metaheuristic Algorithm ◽  
Swarm Optimization ◽  
Sine Cosine Algorithm ◽  
Complex Optimization ◽  
Predicted Model ◽  
Moth Flame Optimization Algorithm ◽  
Development Capability

The antlion optimizer (ALO) is a new swarm-based metaheuristic algorithm for optimization, which mimics the hunting mechanism of antlions in nature. Aiming at the shortcoming that ALO has unbalanced exploration and development capability for some complex optimization problems, inspired by the particle swarm optimization (PSO), the updated position of antlions in elitism operator of ALO is improved, and thus the improved ALO (IALO) is obtained. The proposed IALO is compared against sine cosine algorithm (SCA), PSO, Moth-flame optimization algorithm (MFO), multi-verse optimizer (MVO), and ALO by performing on 23 classic benchmark functions. The experimental results show that the proposed IALO outperforms SCA, PSO, MFO, MVO, and ALO according to the average values and the convergence speeds. And the proposed IALO is tested to optimize the parameters of BP neural network for predicting the Chinese influenza and the predicted model is built, written as IALO-BPNN, which is against the models: BPNN, SCA-BPNN, PSO-BPNN, MFO-BPNN, MVO-BPNN, and ALO-BPNN. It is shown that the predicted model IALO-BPNN has smaller errors than other six predicted models, which illustrates that the IALO has potentiality to optimize the weights and basis of BP neural network for predicting the Chinese influenza effectively. Therefore, the proposed IALO is an effective and efficient algorithm suitable for optimization problems.

scholarly journals IMPLEMENTASI ALGORITMA CAT SWARM OPTIMIZATION DALAM MENYELESAIKAN JOB SHOP SCHEDULING PROBLEM (JSSP)

2016 ◽  
Vol 5 (3) ◽  
pp. 90
Author(s):  
I WAYAN RADIKA APRIANA ◽  
NI KETUT TARI TASTRAWATI ◽  
KARTIKA SARI
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Optimization Problems ◽  
Scheduling Problem ◽  
Metaheuristic Algorithm ◽  
Job Shop Scheduling Problem ◽  
Optimal Result ◽  
Swarm Optimization ◽  
Shop Scheduling ◽  
Cat Swarm Optimization

Cat Swarm Optimization (CSO) algorithm is a metaheuristic algorithm which is based on two behaviors of cat, seeking and tracing. CSO algorithm is used in solving optimization problems. One of the optimization problems which can be seen in daily life is Job Shop Scheduling Problem (JSSP). This study aimed to observe the performance of CSO algorithm in solving JSSP. This study focused on 5 job-12 machine cases. According to this study, CSO algorithm was effective in solving real case of JSSP in 5 jobs – 12 machines scheduling at CV Mitra Niaga Indonesia agriculture tools industry. In implementing CSO algorithm in JSSP, a correct parameter choosing could lead to an optimal result. On other hand, the greater the number of jobs or machines the more complex and difficult the JSSP that needed to be solved.

Sign in / Sign up

Export Citation Format

Share Document