Technique for Multi-Pass Turning Optimization Based on Gaussian Quantum-Behaved Bat Algorithm

The multi-pass turning operation is one of the most commonly used machining methods in manufacturing field.The main objective of this operation is to minimize the unit production cost.This paper proposes a Gaussian quantum-behaved bat algorithm(GQBA)to solve the problem of multi-pass turning operation.The proposed algorithm mainly includes the following two improvements.The first improvement is to incorporate the current optimal positions of quantum bats and the global best position into the stochastic attractor to facilitate population diversification.The second improvement is to use a Gaussian distribution instead of the uniform distribution to update the positions of the quantum-behaved bats,thus performing a more accurate search and avoiding premature convergence.The performance of the presented GQBA is demonstrated through numerical benchmark functions and amulti-pass turning operation problem.Thirteen classical benchmark functions are utilized in the comparison experiments,and the experimental results for accuracy and convergence speed demonstrate that,in most cases,the GQBA can provide a better search capability than other algorithms.Furthermore,GQBA is applied to an optimization problem formulti-pass turning,which is designed tominimize the production cost while considering many practical machining constraints in the machining process.The experimental results indicate that the GQBA outperforms other comparison algorithms in terms of cost reduction,which proves the effectiveness of the GQBA.

Improved Bat Algorithm with Deep Learning-Based Biomedical ECG Signal Classification Model

With new developments experienced in Internet of Things(IoT),wearable,and sensing technology,the value of healthcare services has enhanced.This evolution has brought significant changes from conventional medicine-based healthcare to real-time observation-based healthcare.Biomedical Electrocardiogram(ECG)signals are generally utilized in examination and diagnosis of Cardiovascular Diseases(CVDs)since it is quick and non-invasive in nature.Due to increasing number of patients in recent years,the classifier efficiency gets reduced due to high variances observed in ECG signal patterns obtained from patients.In such scenario computer-assisted automated diagnostic tools are important for classification of ECG signals.The current study devises an Improved Bat Algorithm with Deep Learning Based Biomedical ECGSignal Classification(IBADL-BECGC)approach.To accomplish this,the proposed IBADL-BECGC model initially pre-processes the input signals.Besides,IBADL-BECGC model applies NasNet model to derive the features from test ECG signals.In addition,Improved Bat Algorithm(IBA)is employed to optimally fine-tune the hyperparameters related to NasNet approach.Finally,Extreme Learning Machine(ELM)classification algorithm is executed to perform ECG classification method.The presented IBADL-BECGC model was experimentally validated utilizing benchmark dataset.The comparison study outcomes established the improved performance of IBADL-BECGC model over other existing methodologies since the former achieved a maximum accuracy of 97.49%.

Hybridizing Artificial Bee Colony with Bat Algorithm for Web Service Composition

In the Internet of Things(IoT),the users have complex needs,and the Web Service Composition(WSC)was introduced to address these needs.The WSC’s main objective is to search for the optimal combination of web services in response to the user needs and the level of Quality of Services(QoS)constraints.The challenge of this problem is the huge number of web services that achieve similar functionality with different levels of QoS constraints.In this paper,we introduce an extension of our previous works on the Artificial Bee Colony(ABC)and Bat Algorithm(BA).A new hybrid algorithm was proposed between the ABC and BA to achieve a better tradeoff between local exploitation and global search.The bat agent is used to improve the solution of exhausted bees after a threshold(limits),and also an Elitist Strategy(ES)is added to BA to increase the convergence rate.The performance and convergence behavior of the proposed hybrid algorithm was tested using extensive comparative experiments with current state-ofthe-art nature-inspired algorithms on 12 benchmark datasets using three evaluation criteria(average fitness values,best fitness values,and execution time)that were measured for 30 different runs.These datasets are created from real-world datasets and artificially to form different scale sizes of WSC datasets.The results show that the proposed algorithm enhances the search performance and convergence rate on finding the near-optimal web services combination compared to competitors.TheWilcoxon signed-rank significant test is usedwhere the proposed algorithm results significantly differ fromother algorithms on 100%of datasets.

Neighborhood Search Based Improved Bat Algorithm for Web Service Composition

Web services are provided as reusable software components in the services-oriented architecture.More complicated composite services can be combined from these components to satisfy the user requirements represented as a workflow with specified Quality of Service(QoS)limitations.The workflow consists of tasks where many services can be considered for each task.Searching for optimal services combination and optimizing the overall QoS limitations is a Non-deterministic Polynomial(NP)-hard problem.This work focuses on the Web Service Composition(WSC)problem and proposes a new service composition algorithm based on the micro-bats behavior while hunting the prey.The proposed algorithm determines the optimal combination of the web services to satisfy the complex user needs.It also addresses the Bat Algorithm(BA)shortcomings,such as the tradeoff among exploration and exploitation searching mechanisms,local optima,and convergence rate.The proposed enhancement includes a developed cooperative and adaptive population initialization mechanism.An elitist mechanism is utilized to address the BA convergence rate.The tradeoff between exploration and exploitation is handled through a neighborhood search mechanism.Several benchmark datasets are selected to evaluate the proposed bat algorithm’s performance.The simulation results are estimated using the average fitness value,the standard deviation of the fitness value,and an average of the execution time and compared with four bat-inspired algorithms.It is observed from the simulation results that introduced enhancement obtains significant results.

Modified Bat Algorithm for Optimal VM’s in Cloud Computing

All task scheduling applications need to ensure that resources are optimally used,performance is enhanced,and costs are minimized.The purpose of this paper is to discuss how to Fitness Calculate Values(FCVs)to provide application software with a reliable solution during the initial stages of load balancing.The cloud computing environment is the subject of this study.It consists of both physical and logical components(most notably cloud infrastructure and cloud storage)(in particular cloud services and cloud platforms).This intricate structure is interconnected to provide services to users and improve the overall system’s performance.This case study is one of the most important segments of cloud computing,i.e.,Load Balancing.This paper aims to introduce a new approach to balance the load among Virtual Machines(VM’s)of the cloud computing environment.The proposed method led to the proposal and implementation of an algorithm inspired by the Bat Algorithm(BA).This proposed Modified Bat Algorithm(MBA)allows balancing the load among virtual machines.The proposed algorithm works in two variants:MBA with Overloaded Optimal Virtual Machine(MBAOOVM)and Modified Bat Algorithm with Balanced Virtual Machine(MBABVM).MBA generates cost-effective solutions and the strengths of MBA are finally validated by comparing it with Bat Algorithm.

A Novel Improved Bat Algorithm in UAV Path Planning

Path planning algorithm is the key point to UAV path planning scenario.Many traditional path planning methods still suffer from low convergence rate and insufficient robustness.In this paper,three main methods are contributed to solving these problems.First,the improved artificial potential field(APF)method is adopted to accelerate the convergence process of the bat’s position update.Second,the optimal success rate strategy is proposed to improve the adaptive inertia weight of bat algorithm.Third chaos strategy is proposed to avoid falling into a local optimum.Compared with standard APF and chaos strategy in UAV path planning scenarios,the improved algorithm CPFIBA(The improved artificial potential field method combined with chaotic bat algorithm,CPFIBA)significantly increases the success rate of finding suitable planning path and decrease the convergence time.Simulation results show that the proposed algorithm also has great robustness for processing with path planning problems.Meanwhile,it overcomes the shortcomings of the traditional meta-heuristic algorithms,as their convergence process is the potential to fall into a local optimum.From the simulation,we can see also obverse that the proposed CPFIBA provides better performance than BA and DEBA in problems of UAV path planning.

Self-adaptive Bat Algorithm With Genetic Operations

Swarm intelligence in a bat algorithm(BA)provides social learning.Genetic operations for reproducing individuals in a genetic algorithm(GA)offer global search ability in solving complex optimization problems.Their integration provides an opportunity for improved search performance.However,existing studies adopt only one genetic operation of GA,or design hybrid algorithms that divide the overall population into multiple subpopulations that evolve in parallel with limited interactions only.Differing from them,this work proposes an improved self-adaptive bat algorithm with genetic operations(SBAGO)where GA and BA are combined in a highly integrated way.Specifically,SBAGO performs their genetic operations of GA on previous search information of BA solutions to produce new exemplars that are of high-diversity and high-quality.Guided by these exemplars,SBAGO improves both BA’s efficiency and global search capability.We evaluate this approach by using 29 widely-adopted problems from four test suites.SBAGO is also evaluated by a real-life optimization problem in mobile edge computing systems.Experimental results show that SBAGO outperforms its widely-used and recently proposed peers in terms of effectiveness,search accuracy,local optima avoidance,and robustness.

New Modified Controlled Bat Algorithm for Numerical Optimization Problem

Bat algorithm(BA)is an eminent meta-heuristic algorithm that has been widely used to solve diverse kinds of optimization problems.BA leverages the echolocation feature of bats produced by imitating the bats’searching behavior.BA faces premature convergence due to its local search capability.Instead of using the standard uniform walk,the Torus walk is viewed as a promising alternative to improve the local search capability.In this work,we proposed an improved variation of BA by applying torus walk to improve diversity and convergence.The proposed.Modern Computerized Bat Algorithm(MCBA)approach has been examined for fifteen well-known benchmark test problems.The finding of our technique shows promising performance as compared to the standard PSO and standard BA.The proposed MCBA,BPA,Standard PSO,and Standard BA have been examined for well-known benchmark test problems and training of the artificial neural network(ANN).We have performed experiments using eight benchmark datasets applied from the worldwide famous machine-learning(ML)repository of UCI.Simulation results have shown that the training of an ANN with MCBA-NN algorithm tops the list considering exactness,with more superiority compared to the traditional methodologies.The MCBA-NN algorithm may be used effectively for data classification and statistical problems in the future.

ECO-BAT: A New Routing Protocol for Energy Consumption Optimization Based on BAT Algorithm in WSN

Wireless sensor network (WSN) has been widely used due to its vastrange of applications. The energy problem is one of the important problems influencingthe complete application. Sensor nodes use very small batteries as a powersource and replacing them is not an easy task. With this restriction, the sensornodes must conserve their energy and extend the network lifetime as long as possible.Also, these limits motivate much of the research to suggest solutions in alllayers of the protocol stack to save energy. So, energy management efficiencybecomes a key requirement in WSN design. The efficiency of these networks ishighly dependent on routing protocols directly affecting the network lifetime.Clustering is one of the most popular techniques preferred in routing operations.In this work we propose a novel energy-efficient protocol for WSN based on a batalgorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithmfor WSN) to prolong the network lifetime. We use an objective function thatgenerates an optimal number of sensor clusters with cluster heads (CH) to minimizeenergy consumption. The performance of the proposed approach is comparedwith Low-Energy Adaptive Clustering Hierarchy (LEACH) and EnergyEfficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interestingin terms of energy-saving and prolongation of the network lifetime.

An Optimized Neural Network with Bat Algorithm for DNA Sequence Classification

Recently, many researchers have used nature inspired metaheuristicalgorithms due to their ability to perform optimally on complex problems. Tosolve problems in a simple way, in the recent era bat algorithm has becomefamous due to its high tendency towards convergence to the global optimummost of the time. But, still the standard bat with random walk has a problemof getting stuck in local minima. In order to solve this problem, this researchproposed bat algorithm with levy flight random walk. Then, the proposedBat with Levy flight algorithm is further hybridized with three differentvariants of ANN. The proposed BatLFBP is applied to the problem ofinsulin DNA sequence classification of healthy homosapien. For classificationperformance, the proposed models such as Bat levy flight Artificial NeuralNetwork (BatLFANN) and Bat levy Flight Back Propagation (BatLFBP) arecompared with the other state-of-the-art algorithms like Bat Artificial NeuralNetwork (BatANN), Bat back propagation (BatBP), Bat Gaussian distribution Artificial Neural Network (BatGDANN). And Bat Gaussian distributionback propagation (BatGDBP), in-terms of means squared error (MSE) andaccuracy. From the perspective of simulations results, it is show that theproposed BatLFANN achieved 99.88153% accuracy with MSE of 0.001185,and BatLFBP achieved 99.834185 accuracy with MSE of 0.001658 on WL5.While on WL10 the proposed BatLFANN achieved 99.89899% accuracy withMSE of 0.00101, and BatLFBP achieved 99.84473% accuracy with MSE of0.004553. Similarly, on WL15 the proposed BatLFANN achieved 99.82853%accuracy with MSE of 0.001715, and BatLFBP achieved 99.3262% accuracywith MSE of 0.006738 which achieve better accuracy as compared to the otherhybrid models.

Improved Bat Algorithm Based Energy Efficient Congestion Control Scheme for Wireless Sensor Networks

Energy conservation and congestion control are widely researched topics in Wireless Sensor Networks in recent years. The main objective is to develop a model to find the optimized path on the basis of distance between source and destination and the residual energy of the node. This paper shows an implementation of nature inspired improved Bat Algorithm to control congestion in Wireless Sensor Networks at transport layer. The Algorithm has been applied on the fitness function to obtain an optimum solution. Simulation results have shown improvement in parameters like network lifetime and throughput as compared with CODA (Congestion Detection and Avoidance), PSO (Particle Swarm Optimization) algorithm and ACO (Ant Colony Optimization).

Projection pursuit model of vehicle emission on air pollution at intersections based on the improved bat algorithm

The projection pursuit model is used to study the assessment of air pollution caused by vehicle emissions at intersections. Based on the analysis of the characteristics and regularities of vehicle emissions at intersections, a vehicle emission model based on projection pursuit is established, and the bat algorithm is used to solve the optimization function. The research results show that the projection pursuit model can not only measure the air pollution of vehicle emissions at intersections, but also effectively evaluate the level of vehicle exhaust emissions at intersections. Taking the air pollution caused by vehicle emissions at intersections as the research object and considering the influence factors of vehicle emissions on air pollution comprehensively, the evaluation index system of vehicle emissions at intersections on air pollution is constructed. Based on large data analysis, a prediction model of air pollution caused by vehicle emissions at intersections is constructed, and an improved bat algorithm is used to realize the assessment process. The application results show that the prediction model of vehicle emissions at intersections can define the degree of air pollution caused by vehicle emissions, and it has good guiding significance and practical value for solving the problem of air pollution caused by vehicle emissions.

Echo Location Based Bat Algorithm for Energy Efficient WSN Routing

Due to the wide range of applications,Wireless Sensor Networks(WSN)are increased in day to day life and becomes popular.WSN has marked its importance in both practical and research domains.Energy is the most significant resource,the important challenge in WSN is to extend its lifetime.The energy reduction is a key to extend the network’s lifetime.Clustering of sensor nodes is one of the well-known and proved methods for achieving scalable and energy conserving WSN.In this paper,an energy efficient protocol is proposed using metaheuristic Echo location-based BAT algorithm(ECHO-BAT).ECHO-BAT works in two stages.First Stage clusters the sensor nodes and identifies tentativeCluster Head(CH)along with the entropy value using BAT algorithm.The second stage aims to find the nodes if any,with high residual energy within each cluster.CHs will be replaced by the member node with high residual energy with an objective to choose the CH with high energy to prolong the network’s lifetime.The performance of the proposed work is compared with Low-Energy Adaptive Clustering Hierarchy(LEACH),Power-Efficient Zoning Clustering Algorithm(PEZCA)and Chaotic Firefly Algorithm CH(CFACH)in terms of lifetime of network,death of first nodes,death of 125th node,death of the last node,network throughput and execution time.Simulation results show that ECHO-BAT outperforms the other methods in all the considered measures.The overall delivery ratio has also significantly optimized and improved by approximately 8%,proving the proposed approach to be an energy efficient WSN.

A Novel Bat Algorithm based on Cross Boundary Learning and Uniform Explosion Strategy

Population-based algorithms have been used in many real-world problems.Bat algorithm(BA)is one of the states of the art of these approaches.Because of the super bat,on the one hand,BA can converge quickly;on the other hand,it is easy to fall into local optimum.Therefore,for typical BA algorithms,the ability of exploration and exploitation is not strong enough and it is hard to find a precise result.In this paper,we propose a novel bat algorithm based on cross boundary learning(CBL)and uniform explosion strategy(UES),namely BABLUE in short,to avoid the above contradiction and achieve both fast convergence and high quality.Different from previous opposition-based learning,the proposed CBL can expand the search area of population and then maintain the ability of global exploration in the process of fast convergence.In order to enhance the ability of local exploitation of the proposed algorithm,we propose UES,which can achieve almost the same search precise as that of firework explosion algorithm but consume less computation resource.BABLUE is tested with numerous experiments on unimodal,multimodal,one-dimensional,high-dimensional and discrete problems,and then compared with other typical intelligent optimization algorithms.The results show that the proposed algorithm outperforms other algorithms.

A Novel Self Adaptive Modification Approach Based on Bat Algorithm for Optimal Management of Renewable MG

In the new competitive electricity market, the accurate operation management of Micro-Grid (MG) with various types of renewable power sources (RES) can be an effective approach to supply the electrical consumers more reliably and economically. In this regard, this paper proposes a novel solution methodology based on bat algorithm to solve the op- timal energy management of MG including several RESs with the back-up of Fuel Cell (FC), Wind Turbine (WT), Photovoltaics (PV), Micro Turbine (MT) as well as storage devices to meet the energy mismatch. The problem is formulated as a nonlinear constraint optimization problem to minimize the total cost of the grid and RESs, simultaneously. In addition, the problem considers the interactive effects of MG and utility in a 24 hour time interval which would in- crease the complexity of the problem from the optimization point of view more severely. The proposed optimization technique is consisted of a self adaptive modification method compromised of two modification methods based on bat algorithm to explore the total search space globally. The superiority of the proposed method over the other well-known algorithms is demonstrated through a typical renewable MG as the test system.

Particle Swarm Optimization Bat Algorithm Path Automatically Planning Research for Police Drones in Hilly Cities

Mountain cities are complex asymmetric dynamic network architectures,and the flight of UAVs in this environment is subject to various constraints,while efficiency is a crucial factor in the trajectory planning of police UAVs,which need to maintain high efficiency and safe flight paths between their starting and ending points,but the traditional trajectory planning method cannot meet the requirements of rapid maneuvering of police UAVs.To achieve this,a 3D terrain map is built,an objective function is established for the flight cost in the UAV trajectory planning process,and a planning algorithm called particle swarm optimization bat algorithm(PSOBA)is proposed.PSOBA combines the characteristics of the bat algorithm(BA)and the particle swarm optimization algorithm(PSO)to improve population diversity and resolve the delayed convergence issue in the last phases of BA.Simulation results show that PSOBA is more effective than BA,with a search time for the best solution that is approximately 20.43%shorter and a convergence value of the objective function that is approximately 38%smaller.PSOBA is also able to plan a quicker,shorter,and safer flight path compared to other trail planning algorithms that enhance the bat algorithm.These findings suggest that PSOBA is a powerful algorithm with potential application value in UAV trajectory planning control in the mobile intelligence era.Contribute to the service of public social security.

Hybrid Deep Learning-Improved BAT Optimization Algorithm for Soil Classification Using Hyperspectral Features

Now a days,Remote Sensing(RS)techniques are used for earth observation and for detection of soil types with high accuracy and better reliability.This technique provides perspective view of spatial resolution and aids in instantaneous measurement of soil’s minerals and its characteristics.There are a few challenges that is present in soil classification using image enhancement such as,locating and plotting soil boundaries,slopes,hazardous areas,drainage condition,land use,vegetation etc.There are some traditional approaches which involves few drawbacks such as,manual involvement which results in inaccuracy due to human interference,time consuming,inconsistent prediction etc.To overcome these draw backs and to improve the predictive analysis of soil characteristics,we propose a Hybrid Deep Learning improved BAT optimization algorithm(HDIB)for soil classification using remote sensing hyperspectral features.In HDIB,we propose a spontaneous BAT optimization algorithm for feature extraction of both spectral-spatial features by choosing pure pixels from the Hyper Spectral(HS)image.Spectral-spatial vector as training illustrations is attained by merging spatial and spectral vector by means of priority stacking methodology.Then,a recurring Deep Learning(DL)Neural Network(NN)is used for classifying the HS images,considering the datasets of Pavia University,Salinas and Tamil Nadu Hill Scene,which in turn improves the reliability of classification.Finally,the performance of the proposed HDIB based soil classifier is compared and analyzed with existing methodologies like Single Layer Perceptron(SLP),Convolutional Neural Networks(CNN)and Deep Metric Learning(DML)and it shows an improved classification accuracy of 99.87%,98.34%and 99.9%for Tamil Nadu Hills dataset,Pavia University and Salinas scene datasets respectively.

基于WOA-BAT的多能源微电网优化调度

为了提高微电网日常运行的经济性和环保性,以及解决鲸鱼算法(WOA)收敛速度较慢、易陷入局部最优的问题,提出了一种鲸鱼-蝙蝠算法(WOA-BAT)。首先,建立微电网优化调度模型,在模型中引入BAT算法对WOA算法进行优化;其次,将鲸鱼觅食行为和蝙蝠搜索策略相结合,将WOA-BAT算法用于仿真微电网并网模式下的多目标优化调度。仿真结果表明:WOA-BAT算法相比于传统的WOA、BAT和粒子群优化算法(PSO),能有效提高微电网日运行总效益及系统运行稳定性。

A Discrete Bat Algorithm for Disassembly Sequence Planning

Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model(FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm(GA), particle swarm optimization(PSO) algorithm and differential mutation BA(DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.

Application of Bat Algorithm Based Time Optimal Control in Multi-robots Formation Reconfiguration

This paper proposes a Bat Algorithm （BA） based Control Parameterization and Time Discretization （BA-CPTD） method to acquire time optimal control law for formation reconfiguration of multi-robots system. In this method, the problem of seeking for time optimal control law is converted into a parameter optimization problem by control parameterization and time discretization, so that the control law can be derived with BA. The actual state of a multi-robots system is then introduced as feedback information to eliminate formation error. This method can cope with the situations where the accurate mathematical model of a system is unavailable or the disturbance from the environment exists. Field experiments have verified the effectiveness of the proposed method and shown that formation converges faster than some existing methods. Further experiment results illustrate that the time optimal control law is able to provide smooth control input for robots to follow, so that the desired formation can be attained rapidly with minor formation error. The formation error will finally be eliminated by using actual state as feedback.