Search results

The purpose of this paper is to acquaint a wide audience of readers with some of the unique remote sensing and navigation capabilities of animals.

Biomimetic comparison of remote sensors evolved by animals and sensors designed by man. The study and comparison includes thermal infrared sensors used by snakes, echolocation used by bats and dolphins, and navigation methods used by birds. Countermeasures used by prey to avoid capture are also considered.

Some animals have remote sensing and navigation capabilities that are considerably more efficient than those provided by the human body or designed by man.

Sensor designers may be encouraged to use the biometic approach in the design of new sensors.

The paper provides a better understanding of animal behaviour, especially their unique abilities to remotely sense, echolocate and navigate with high accuracy over considerable distances.

The paper presents a comparison of remote sensors used by animals with those developed by humans. Remote sensor designers can learn to improve their sensor designs by studying animal sensors within a biomimetic framework.

The purpose of this study is to provide the reader with a full study of the bat algorithm, including its limitations, the fields that the algorithm has been applied, versatile optimization problems in different domains and all the studies that assess its performance against other meta-heuristic algorithms.

Bat algorithm is given in-depth in terms of backgrounds, characteristics, limitations, it has also displayed the algorithms that hybridized with BA (K-Medoids, back-propagation neural network, harmony search algorithm, differential evaluation strategies, enhanced particle swarm optimization and Cuckoo search algorithm) and their theoretical results, as well as to the modifications that have been performed of the algorithm (modified bat algorithm, enhanced bat algorithm, bat algorithm with mutation (BAM), uninhabited combat aerial vehicle-BAM and non-linear optimization). It also provides a summary review that focuses on improved and new bat algorithm (directed artificial bat algorithm, complex-valued bat algorithm, principal component analyzes-BA, multiple strategies coupling bat algorithm and directional bat algorithm).

Shed light on the advantages and disadvantages of this algorithm through all the research studies that dealt with the algorithm in addition to the fields and applications it has addressed in the hope that it will help scientists understand and develop it.

As far as the research community knowledge, there is no comprehensive survey study conducted on this algorithm covering all its aspects.

Nature‐inspired algorithms are among the most powerful algorithms for optimization. The purpose of this paper is to introduce a new nature‐inspired metaheuristic optimization algorithm, called bat algorithm (BA), for solving engineering optimization tasks.

The proposed BA is based on the echolocation behavior of bats. After a detailed formulation and explanation of its implementation, BA is verified using eight nonlinear engineering optimization problems reported in the specialized literature.

BA has been carefully implemented and carried out optimization for eight well‐known optimization tasks; then a comparison has been made between the proposed algorithm and other existing algorithms.

The optimal solutions obtained by the proposed algorithm are better than the best solutions obtained by the existing methods. The unique search features used in BA are analyzed, and their implications for future research are also discussed in detail.

The first order reliability method requires optimization algorithms to find the minimum distance from the origin to the limit state surface in the normal space. The purpose of this paper is to develop an improved version of the new metaheuristic algorithm inspired from echolocation behaviour of bats, namely, the bat algorithm (BA) dedicated to perform structural reliability analysis.

Modifications have been embedded to the standard BA to enhance its efficiency, robustness and reliability. In addition, a new adaptive penalty equation dedicated to solve the problem of the determination of the reliability index and a proposition on the limit state formulation are presented.

The comparisons between the improved bat algorithm (iBA) presented in this paper and other standard algorithms on benchmark functions show that the iBA is highly efficient, and the application to structural reliability problems such as the reliability analysis of overhead crane girder proves that results obtained with iBA are highly reliable.

A new iBA and an adaptive penalty equation for handling equality constraint are developed to determine the reliability index. In addition, the low computing time and the ease implementation of this method present great advantages from the engineering viewpoint.

In this paper, we present a new hybrid binary version of bat and enhanced particle swarm optimization algorithm in order to solve feature selection problems. The proposed algorithm is called Hybrid Binary Bat Enhanced Particle Swarm Optimization Algorithm (HBBEPSO). In the proposed HBBEPSO algorithm, we combine the bat algorithm with its capacity for echolocation helping explore the feature space and enhanced version of the particle swarm optimization with its ability to converge to the best global solution in the search space. In order to investigate the general performance of the proposed HBBEPSO algorithm, the proposed algorithm is compared with the original optimizers and other optimizers that have been used for feature selection in the past. A set of assessment indicators are used to evaluate and compare the different optimizers over 20 standard data sets obtained from the UCI repository. Results prove the ability of the proposed HBBEPSO algorithm to search the feature space for optimal feature combinations.

Bat algorithm (BA) is a global optimization method, but has a worse performance on engineering optimization problems. The purpose of this study is to propose a novel chaotic bat algorithm based on catfish effect (CE-CBA), which can effectively deal with optimization problems in real-world applications.

Incorporating chaos strategy and catfish effect, the proposed algorithm can not only enhance the ability for local search but also improve the ability to escape from local optima traps. On the one hand, the performance of CE-CBA has been evaluated by a set of numerical experiment based on classical benchmark functions. On the other hand, five benchmark engineering design problems have been also used to test CE-CBA.

The statistical results of the numerical experiment show the significant improvement of CE-CBA compared with the standard algorithms and improved bat algorithms. Moreover, the feasibility and effectiveness of CE-CBA in solving engineering optimization problems are demonstrated.

This paper proposed a novel BA with two improvement strategies including chaos strategy and catfish effect for the first time. Meanwhile, the proposed algorithm can be used to solve many real-world engineering optimization problems with several decision variables and constraints.

This paper aims to quantify the dependence relationship of bat algorithm’s (BA) behaviour on the factors that could possibly affect the outputs, and rank the importance of the various uncertain factors thus suggesting research priorities.

This paper conducts a sensitivity analysis based on variance decomposition of factors in both of original and improved BA. The data sets for sensitivity analysis are generated by optimal Latin hyper sampling in the design of experiment. The optimal factor sets are screened by stochastic error bar measures for the effective and robust implementation of BA.

The paper reveals the inner dependent relationship between factors and output in both of original and improved BA. It figures out the weakness in original BA and improves that. It suggests that uncertainty brought about by factors are mainly caused by the interaction effect and all the higher-order term in sensitivity indices for both of original and improved BA. It ranks the main effect and the total effect of factors and screens out some optimal factor sets for BA.

This paper quantifies the dependence relationship of BA’s behaviour on the factors that could affect outputs using sensitivity analysis based on variance decomposition.

This study aims to improve the bat algorithm (BA) performance for solving optimization problems in electrical engineering.

For this task, two strategies were investigated. The first one is based on including the crossover technique into classical BA, in the same manner as in the genetic algorithm method. Therefore, the newly generated version of BA is called the crossover–bat algorithm (C-BA). In the second strategy, a hybridization of the BA with the Nelder–Mead (NM) simplex method was performed; it gives the NM-BA algorithm.

First, the proposed strategies were applied to solve a set of two standard benchmark problems; then, they were applied to solve the TEAM workshop problem 25, where an electromagnetic field was computed by use of the 2D non-linear finite element method. Both optimization algorithms and finite element computation tool were implemented under MATLAB.

The two proposed optimization strategies, C-BA and NM-BA, have allowed good improvements of classical BA, generally known for its poor solution quality and slow convergence rate.

This paper aims to deal with the development of a newly improved version of teaching learning based optimization (TLBO) algorithm.

Random local search part was added to the classic optimization process with TLBO. The new version is called TLBO algorithm with random local search (TLBO-RLS).

At first step and to validate the effectiveness of the new proposed version of the TLBO algorithm, it was applied to a set of two standard benchmark problems. After, it was used jointly with two-dimensional non-linear finite element method to solve the TEAM workshop problem 25, where the results were compared with those resulting from classical TLBO, bat algorithm, hybrid TLBO, Nelder–Mead simplex method and other referenced work.

New TLBO-RLS proposed algorithm contains a part of random local search, which allows good exploitation of the solution space. Therefore, TLBO-RLS provides better solution quality than classic TLBO.

The development of information technologies has led to a considerable transformation in human resource management from conventional or commonly known as personnel management to modern one. Data mining technology, which has been widely used in several applications, including those that function on the web, includes clustering algorithms as a key component. Web intelligence is a recent academic field that calls for sophisticated analytics and machine learning techniques to facilitate information discovery, particularly on the web. Human resource data gathered from the web are typically enormous, highly complex, dynamic, and unstructured. Traditional clustering methods need to be upgraded because they are ineffective. Standard clustering algorithms are enhanced and expanded with optimization capabilities to address this difficulty by swarm intelligence, a subset of nature-inspired computing. We collect the initial raw human resource data and preprocess the data wherein data cleaning, data normalization, and data integration takes place. The proposed K-C-means-data driven cuckoo bat optimization algorithm (KCM-DCBOA) is used for clustering of the human resource data. The feature extraction is done using principal component analysis (PCA) and the classification of human resource data is done using support vector machine (SVM). Other approaches from the literature were contrasted with the suggested approach. According to the experimental findings, the suggested technique has extremely promising features in terms of the quality of clustering and execution time.