Blended Biogeography-based Optimization for Constrained Optimization

Biogeography-based optimization (BBO) is a new evolutionary optimization method that is based on the science of biogeography. We propose two extensions to BBO. First, we propose a blended migration operator. Benchmark results show that blended BBO outperforms standard BBO. Second, we employ blended BBO to solve constrained optimization problems. Constraints are handled by modifying the BBO immigration and emigration procedures. The approach that we use does not require any additional tuning parameters beyond those that are required for unconstrained problems. The constrained blended BBO algorithm is compared with solutions based on a stud genetic algorithm (SGA) and standard particle swarm optimization 2007 (SPSO 07). The numerical results demonstrate that constrained blended BBO outperforms SGA and performs similarly to SPSO 07 for constrained single-objective optimization problems

QUORUM SENSING BASED BACTERIAL SWARM OPTIMIZATION ON TEST BENCHMARK FUNCTIONS

The Bacterial swarm optimization is one of the latest optimization technique mainly inspired from the swarm of bacteria. This paper introduces an intelligent Quorum sensing based Bacterial Swarm Optimization (QBSO) technique for testing and validation. The quorum sensing senses the best position of the bacteria by knowing the worst place in search space. By knowing these positions, the best optimal solution is attained. Here in this proposed QBSO algorithm the exploration capability of the bacteria is well improved. The proposed technique is validated on the seven standard benchmark with unimodal and multimodal test function for its feasibility and optimality. The basic swarm based optimization algorithms such as Particle Swarm Optimization, Ant Colony Optimization, Biogeography Based Optimization, Simulated Bee Colony and conventional Bacterial Swarm Optimization with the standard parameters are simulated and associated with the proposed technique. The attained results evidently indicate that the proposed method outperforms from the considered optimization methods. Further, the proposed technique may apply to any engineering problems, especially for complex real time optimization problems

A Feasibility Study of BBP for predicting shear capacity of FRP reinforced concrete beams without stirrups.

yesShear failure of concrete elements reinforced with Fiber Reinforced Polymer (FRP) bars is generally brittle, requiring accurate predictions to avoid it. In the last decade, a variety of artificial intelligence based approaches have been successfully applied to predict the shear capacity of FRP Reinforced Concrete (FRP-RC). In this paper, a new approach, namely, biogeography-based programming (BBP) is introduced for predicting the shear capacity of FRP-RC beams based on test results available in the literature. The performance of the BBP model is compared with several shear design equations, two previously developed artificial intelligence models and experimental results. It was found that the proposed model provides the most accurate results in calculating the shear capacity of FRP-RC beams among the considered shear capacity models. The proposed BBP model can also correctly predict the trend of different influencing variables on the shear capacity of FRP-RC beams

Ensemble Multi-Objective Biogeography-Based Optimization with Application to Automated Warehouse Scheduling

This paper proposes an ensemble multi-objective biogeography-based optimization (EMBBO) algorithm, which is inspired by ensemble learning, to solve the automated warehouse scheduling problem. First, a real-world automated warehouse scheduling problem is formulated as a constrained multi-objective optimization problem. Then EMBBO is formulated as a combination of several multi-objective biogeography-based optimization (MBBO) algorithms, including vector evaluated biogeography-based optimization (VEBBO), non-dominated sorting biogeography-based optimization (NSBBO), and niched Pareto biogeography-based optimization (NPBBO). Performance is tested on a set of 10 unconstrained multi-objective benchmark functions and 10 constrained multi-objective benchmark functions from the 2009 Congress on Evolutionary Computation (CEC), and compared with single constituent MBBO and CEC competition algorithms. Results show that EMBBO is better than its constituent algorithms, and among the best CEC competition algorithms, for the benchmark functions studied in this paper. Finally, EMBBO is successfully applied to the automated warehouse scheduling problem, and the results show that EMBBO is a competitive algorithm for automated warehouse scheduling

Ensemble Multi-Objective Biogeography-Based Optimization with Application to Automated Warehouse Scheduling

This paper proposes an ensemble multi-objective biogeography-based optimization (EMBBO) algorithm, which is inspired by ensemble learning, to solve the automated warehouse scheduling problem. First, a real-world automated warehouse scheduling problem is formulated as a constrained multi-objective optimization problem. Then EMBBO is formulated as a combination of several multi-objective biogeography-based optimization (MBBO) algorithms, including vector evaluated biogeography-based optimization (VEBBO), non-dominated sorting biogeography-based optimization (NSBBO), and niched Pareto biogeography-based optimization (NPBBO). Performance is tested on a set of 10 unconstrained multi-objective benchmark functions and 10 constrained multi-objective benchmark functions from the 2009 Congress on Evolutionary Computation (CEC), and compared with single constituent MBBO and CEC competition algorithms. Results show that EMBBO is better than its constituent algorithms, and among the best CEC competition algorithms, for the benchmark functions studied in this paper. Finally, EMBBO is successfully applied to the automated warehouse scheduling problem, and the results show that EMBBO is a competitive algorithm for automated warehouse scheduling

Hybrid biogeography-based evolutionary algorithms

Hybrid evolutionary algorithms (EAs) are effective optimization methods that combine multiple EAs. We propose several hybrid EAs by combining some recently-developed EAs with a biogeography-based hybridization strategy. We test our hybrid EAs on the continuous optimization benchmarks from the 2013 Congress on Evolutionary Computation (CEC) and on some real-world traveling salesman problems. The new hybrid EAs include two approaches to hybridization: (1) iteration-level hybridization, in which various EAs and BBO are executed in sequence; and (2) algorithm-level hybridization, which runs various EAs independently and then exchanges information between them using ideas from biogeography. Our empirical study shows that the new hybrid EAs significantly outperforms their constituent algorithms with the selected tuning parameters and generation limits, and algorithm-level hybridization is generally better than iteration-level hybridization. Results also show that the best new hybrid algorithm in this paper is competitive with the algorithms from the 2013 CEC competition. In addition, we show that the new hybrid EAs are generally robust to tuning parameters. In summary, the contribution of this paper is the introduction of biogeography-based hybridization strategies to the EA community

INTELLIGENT FRACTIONAL ORDER ITERATIVE LEARNING CONTROL USING FEEDBACK LINEARIZATION FOR A SINGLE-LINK ROBOT

In this paper, iterative learning control (ILC) is combined with an optimal fractional order derivative (BBO-Da-type ILC) and optimal fractional and proportional-derivative (BBO-PDa-type ILC). In the update law of Arimoto's derivative iterative learning control, a first order derivative of tracking error signal is used. In the proposed method, fractional order derivative of the error signal is stated in term of 'sa' where  to update iterative learning control law. Two types of fractional order iterative learning control namely PDa-type ILC and Da-type ILC are gained for different value of a. In order to improve the performance of closed-loop control system, coefficients of both  and  learning law i.e. proportional , derivative  and  are optimized using Biogeography-Based optimization algorithm (BBO). Outcome of the simulation results are compared with those of the conventional fractional order iterative learning control to verify effectiveness of BBO-Da-type ILC and BBO-PDa-type IL

Linearized biogeography-based optimization with re-initialization and local search

Biogeography-based optimization (BBO) is an evolutionary optimization algorithm that uses migration to share information among candidate solutions. One limitation of BBO is that it changes only one independent variable at a time in each candidate solution. In this paper, a linearized version of BBO, called LBBO, is proposed to reduce rotational variance. The proposed method is combined with periodic re-initialization and local search operators to obtain an algorithm for global optimization in a continuous search space. Experiments have been conducted on 45 benchmarks from the 2005 and 2011 Congress on Evolutionary Computation, and LBBO performance is compared with the results published in those conferences. The results show that LBBO provides competitive performance with state-of-the-art evolutionary algorithms. In particular, LBBO performs particularly well for certain types of multimodal problems, including high-dimensional real-world problems. Also, LBBO is insensitive to whether or not the solution lies on the search domain boundary, in a wide or narrow basin, and within or outside the initialization domain

Design of wind farm layout with non-uniform turbines using fitness difference based BBO

Biogeography-based optimization (BBO) is an emerging meta-heuristic algorithm. BBO is inspired from the migration of species from one island to another. This study presents the solution of the wind farm layout optimization problem with wind turbines having non-uniform hub heights and rotor radii using BBO and an improved version of BBO. This study proposes an improved version of BBO, Fitness Difference Based BBO (FD-BBO). FD-BBO is obtained by incorporating the concept of fitness differences in original BBO. First, in order to justify the superiority of FD-BBO over BBO, it is tested over $15$ standard test problems of optimization. The numerical results of FD-BBO are compared with the original version of BBO and an advanced version of BBO, Blended BBO (BBBO). Through graphical and statistical analyses, FD-BBO is established to be an efficient and accurate algorithm. The BBO, BBBO and FD-BBO are than applied to solve the wind farm layout optimization problem. In the considered problem, not only the location of the wind turbines but hub heights and rotor radii are also taken as decision variables. Two cases of the problems are dealt: $26$ turbines in the farm size of $2000m$ $\times$ $2000m$ and $30$ turbines in the farm size of $2000m$ $\times$ $2000m$. Numerical results are compared with earlier published results and that of original BBO and Blended BBO. It is found that FD-BBO is the better approach to solving the problem under consideration