Multistage fast charging optimization protocol for lithium-ion batteries based on the biogeography-based algorithm

A robust approach for optimal design of plate fin heat exchangers using biogeography based optimization (BBO) algorithm

Biogeography-based Optimization (BBO) Algorithm for Single Machine Total Weighted Tardiness Problem (SMTWTP)

Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solving optimization problems. The BBO algorithm has three principal operators called migration, mutation and elite selection. The migration operator plays a very important role in sharing information among the candidate habitats. The original BBO algorithm, due to its poor exploration and exploitation, sometimes does not perform desirable results. On the other hand, the Edge Assembly Crossover (EAX) has been one of the high power crossovers for acquiring offspring and it increased the diversity of the population. The combination of biogeography-based optimization algorithm and EAX can provide high efficiency in solving optimization problems, including the traveling salesman problem (TSP). This paper proposed a combination of those approaches to solve traveling salesman problem. The new hybrid approach was examined with standard datasets for TSP in TSPLIB. In the experiments, the performance of the proposed approach was better than the original BBO and four others widely used metaheuristics algorithms.

Task scheduling, which plays a crucial role in cloud computing and is the critical factor influencing the performance of cloud computing, is an NP-hard problem that can be solved with a heuristic algorithm. In this paper, we propose a novel heuristic algorithm, called biogeography-based optimization (BBO), and a new hybrid migrating BBO (HMBBO) algorithm, which integrates the migration strategy with particle swarm optimization (PSO). Both methods are proposed to solve the problem of scheduling-directed acyclic graph tasks in a cloud computing environment. The basic idea of our approach is to exploit the advantages of the PSO and BBO algorithms while avoiding their drawbacks. In HMBBO, the flight strategy under the BBO migration structure is hybridized to accelerate the search speed, and HEFT_D is used to evaluate the task sequence. Based on the WorkflowSim, a comparative experiment is conducted with the makespan of task scheduling as the objective function. In HMBBO, the flight strategy under the BBO migration structure is hybridized to accelerate the search speed, and HEFT_D is used to evaluate the task sequence. Based on the WorkflowSim, a comparative experiment is conducted with the makespan of task scheduling as the objective function. Both simulation and real-life experiments are conducted to verify the effectiveness of HMBBO. The experiment shows that compared with several classic heuristic algorithms, HMBBO has advantages in terms of global search ability, fast convergence rate and a high-quality solution, and it provides a new method for task scheduling in cloud computing.

It is well-known that the biogeography-based optimization (BBO) algorithm lacks searching power in some circumstances. In order to address this issue, an adaptive opposition-based biogeography-based optimization algorithm (AO-BBO) is proposed. Based on the BBO algorithm and opposite learning strategy, this algorithm chooses different opposite learning probabilities for each individual according to the habitat suitability index (HSI), so as to avoid elite individuals from returning to local optimal solution. Meanwhile, the proposed method is tested in 9 benchmark functions respectively. The results show that the improved AO-BBO algorithm can improve the population diversity better and enhance the search ability of the global optimal solution. The global exploration capability, convergence rate and convergence accuracy have been significantly improved. Eventually, the algorithm is applied to the parameter optimization of soft-sensing model in plant medicine extraction rate. The simulation results show that the model obtained by this method has higher prediction accuracy and generalization ability.

The biogeography-based optimisation (BBO) algorithm is a novel evolutionary algorithm inspired by biogeography. Similarly, to other evolutionary algorithms, entrapment in local optima and slow convergence speed are two probable problems it encounters in solving challenging real problems. Due to the novelty of this algorithm, however, there is little in the literature regarding alleviating these two problems. Chaotic maps are one of the best methods to improve the performance of evolutionary algorithms in terms of both local optima avoidance and convergence speed. In this study, we utilise ten chaotic maps to enhance the performance of the BBO algorithm. The chaotic maps are employed to define selection, emigration, and mutation probabilities. The proposed chaotic BBO algorithms are benchmarked on ten test functions. The results demonstrate that the chaotic maps (especially Gauss/mouse map) are able to significantly boost the performance of BBO. In addition, the results show that the combination of chaotic selection and emigration operators results in the highest performance.

This paper studies the performance of a wireless sensor network (WSN) in the context of binary detection of a deterministic signal. This paper aims to develop a numerical solution for the optimal power allocation scheme via a variation of the biogeography-based optimization (BBO) algorithm, which is called the constrained BBO-DE algorithm. This new stochastic optimization algorithm is a hybridization of a very recently proposed stochastic optimization algorithm, i.e., the BBO algorithm, with another popular stochastic optimization algorithm called the differential evolution (DE) algorithm. The objective is to minimize the total power spent by the whole sensor network under a desired performance criterion, which is specified as the detection error probability. The proposed algorithm has been tested for several case studies, and its performances are compared with those of two constrained versions of the BBO and DE algorithms.

This paper presents an optimum network structure based on a BBO tuned adaptive neuro-fuzzy inference system (ANFIS) to control an active suspension system (ASS). The unsupervised learning via Biogeography-Based Optimization (BBO) algorithm is used to train the ANFIS network. The optimal proportional-integral-derivative controller tuned based on the LQR method is used to generate the training data set. ANFIS base on Fuzzy c-means (FCM) clustering algorithm is applied to approximate the relationships between the vehicle body (sprung mass) vertical input velocity and the actuator output force. BBO algorithm is used to optimize fuzzy c means clustering parameters. The numerical simulation results showed that the proposed optimized BBO-FCMANFIS based vehicle suspension system has better performance as compared with the optimal LQR-PID controller under uncertainties in both of reducing actuator energy consumption and the suppression of the vibration of the sprung mass acceleration, with a 43% and 9.5% reduction, respectively.

ABSTRACTIn this article, a new version of a biogeography-based optimization algorithm with Levy flight distribution (LFBBO) is introduced and used for the optimum design of reinforced concrete cantilever retaining walls under seismic loading. The cost of the wall is taken as an objective function, which is minimized under the constraints implemented by the American Concrete Institute (ACI 318-05) design code and geometric limitations. The influence of peak ground acceleration (PGA) on optimal cost is also investigated. The solution of the problem is attained by the LFBBO algorithm, which is developed by adding Levy flight distribution to the mutation part of the biogeography-based optimization (BBO) algorithm. Five design examples, of which two are used in literature studies, are optimized in the study. The results are compared to test the performance of the LFBBO and BBO algorithms, to determine the influence of the seismic load and PGA on the optimal cost of the wall.

Biogeography-based optimization algorithm for large-scale multistage batch plant scheduling

This paper performs optimization for plane steel frames with semi-rigid beam-to-column connections, in a company with fixed, semi-rigid and hinged base connections using a biogeography-based optimization algorithm (BBO), along with a genetic algorithm (GA). In this paper, Kanvinde and Grilli [1] nonlinear model is used for simulating semi-rigid base connections, where this model considers all deformations in different base connection components under the applied loads to determine the relative spring rotation for the sake of getting accurate base rotational stiffness value. In addition, Frye and Morris [2] nonlinear model is used for simulating semi-rigid beam-to-column connections. The P-∆ effect and geometric nonlinearity are considered. The stress and displacement constraints of AISC-LRFD [3] specifications, together with size adjustment constraints, are considered in the design procedure.

Constrained optimization problems are very important as they are encountered in many science and engineering applications. A hybrid method based on modified augmented Lagran- gian multiplier and biogeography-based optimization (BBO) algorithm is proposed to solve con- strained optimization problems. The basic steps of the proposed method are comprised of an outer iteration, in which the Lagrangian multipliers and various penalty parameters are updated using a first-order update scheme, and an inner iteration, in which a nonlinear optimization of the modified augmented Lagrangian function with simple bound constraints is implemented by BBO algorithm. Numerical results show that the proposed method is reliable and efficient for solving constrained optimization problems.

Recent trend of research is to hybridize two and more metaheuristics algorithms to obtain superior solution in the field of optimization problems. This paper proposes a newly developed wrapper‐based feature selection method based on the hybridization of Biogeography Based Optimization (BBO) and Sine Cosine Algorithm (SCA) for handling feature selection problems. The position update mechanism of SCA algorithm is introduced into the BBO algorithm to enhance the diversity among the habitats. In BBO, the mutation operator is got rid of and instead of it, a position update mechanism of SCA algorithm is applied after the migration operator, to enhance the global search ability of Basic BBO. This mechanism tends to produce the highly fit solutions in the upcoming iterations, which results in the improved diversity of habitats. The performance of this Improved BBO (IBBO) algorithm is investigated using fourteen benchmark datasets. Experimental results of IBBO are compared with eight other search algorithms. The results show that IBBO is able to outperform the other algorithms in majority of the datasets. Furthermore, the strength of IBBO is proved through various numerical experiments like statistical analysis, convergence curves, ranking methods, and test functions. The results of the simulation have revealed that IBBO has produced very competitive and promising results, compared to the other search algorithms.

Technology has enabled us to carry the world on our tips. Cloud computing has majorly contributed to this by providing infrastructure services on the go using pay per use model and with high quality of services. Cloud services provide resources through various distributed datacenters and client requests been fulfilled over these datacenters which act as resources. Therefore, resource allocation plays an important role in providing a high quality of service like utilization, network delay and finish time. Biogeography-based optimization (BBO) is an optimization algorithm that is an evolutionary algorithm used to find optimized solution. In this work BBO algorithm is been used for resource optimization problem in cloud environment at infrastructure as a service level. In past several task scheduling algorithms are being proposed to find a global best schedule to achieve least execution time and high performance like genetic algorithm, ACO and many more but as compared to GA, BBO has high probability to find global best solution. Existing solutions aim toward improving performance in term of power execution time, but they have not considered network performance and utilization of the systems performance parameters. Therefore, to improve the performance of cloud in network-aware environment we have proposed an efficient nature inspired BBO algorithm. Further, the proposed approach takes network overhead and utilization of the system into consideration to provide improved performance as compared to ACO, Genetic algorithm as well as with PSO.

Renewable energy systems (RESs) are affordable, clean and sustainable. However, their output power is intermittent. Therefore, RESs are usually combined with an energy storage system or conventional sources to make the overall operation uninterruptable. Optimal sizing of hybrid energy system components is imperative to be financially and technically feasible. In this study, a multi‐objective optimisation based on a hybrid optimisation procedure, which combines the exploitation ability of the biogeography‐based optimisation (BBO) with the exploration ability of the particle swarm optimisation (PSO), is used to handle the system design. This algorithm is known as greedy particle swarm and BBO algorithm (GPSBBO). Weighted sum method is added to the GPSBBO to handle the multi‐objective nature of the design problem. A case study for a hybrid wind‐PV energy system design in the standalone and grid‐connected configurations is presented to illustrate the proposed method. Coverage of two sets, hypervolume and diversity performance indices are used to compare results of the proposed method to non‐dominated sorting genetic algorithm and the multi‐objective PSO. These indices show an improved performance of the suggested method in finding the optimal system design.