Biogeography-based optimization (BBO) is an evolutionary algorithm (EA) that optimizes a function by stochastically and iteratively improving candidate solutions with regard to a given measure of quality, or fitness function. BBO belongs to the class of metaheuristics since it includes many variations, and since it does not make any assumptions about the problem and can therefore be applied to a wide class of problems.

BBO is typically used to optimize multidimensional real-valued functions, but it does not use the gradient of the function, which means that it does not require the function to be differentiable as required by classic optimization methods such as gradient descent and quasi-newton methods. BBO can therefore be used on discontinuous functions.

BBO optimizes a problem by maintaining a population of candidate solutions, and creating new candidate solutions by combining existing ones according to a simple formula. In this way the objective function is treated as a black box that merely provides a measure of quality given a candidate solution, and the function's gradient is not needed.

Like many EAs, BBO was motivated by a natural process; in particular, BBO was motivated by biogeography, which is the study of the distribution of biological species through time and space.^[1] BBO was originally introduced by Dan Simon in 2008.^[2]

Underlying principles

Mathematical models of biogeography describe speciation (the evolution of new species), the migration of species (animals, fish, birds, or insects) between islands, and the extinction of species.^[3] Islands that are friendly to life are said to have a high habitat suitability index (HSI).^[4] Features that correlate with HSI include rainfall, vegetative diversity, topographic diversity, land area, temperature, and others. The features that determine are called suitability index variables (SIVs). In terms of habitability, SIVs are the independent variables and HSI is the dependent variable.

Islands with a high HSI can support many species, and islands with a low HSI can support only a few species. Islands with a high HSI have many species that emigrate to nearby habitats because of the large populations and the large numbers of species that they host. Note that emigration from an island with a high HSI does not occur because species want to leave their home; after all, their home island is an attractive place to live. Emigration occurs because of the accumulation of random effects on a large number of species with large populations. Emigration occurs as animals ride flotsam, swim, fly, or ride the wind to neighboring islands. When a species emigrates from an island, it does not mean that the species completely disappears from its original island; only a few representatives emigrate, so an emigrating species remains present on its original island while at the same time migrating to a neighboring island. However, in BBO it is assumed that emigration from an island results in extinction from that island. This assumption is necessary in BBO because species represent the independent variables of a function, and each island represents a candidate solution to a function optimization problem.

Islands with a high HSI not only have a high emigration rate, but they also have a low immigration rate because they already support many species. Species that migrate to such islands will tend to die in spite of the island's high HSI, because there is too much competition for resources from other species.

Islands with a low HSI have a high immigration rate because of their low populations. Again, this is not because species want to immigrate to such islands; after all, these islands are undesirable places to live. The reason that immigration occurs to these islands is because there is a lot of room for additional species. Whether or not the immigrating species can survive in its new home, and for how long, is another question. However, species diversity is correlated with HSI, so when more species arrive at a low HSI island, the island's HSI will tend to increase.^[4]

The figure on the right illustrates an island migration model.^[3] The immigration rate ${\displaystyle \lambda }$ and the emigration rate ${\displaystyle \mu }$ are functions of the number of species on the island. The maximum possible immigration rate ${\displaystyle I}$ occurs when there are zero species on the island. As the number of species increases, the island becomes more crowded, fewer species are able to survive immigration, and the immigration rate decreases. The largest possible number of species that the habitat can support is ${\displaystyle S_{\max }}$, at which point the immigration rate is zero. If there are no species on the island, then the emigration rate is zero. As the number of species on the island increases, it becomes more crowded, more species representatives are able to leave the island, and the emigration rate increases. When the island contains the largest number of possible species ${\displaystyle S_{\max }}$, the emigration rate reaches its maximum possible value ${\displaystyle E}$.

Model of immigration ${\displaystyle \lambda }$ and emigration ${\displaystyle \mu }$ probabilities. ${\displaystyle S_{0}}$ is the equilibrium species count, and ${\displaystyle S_{\max }}$ is the maximum number of species that the island can support. ${\displaystyle I}$ and ${\displaystyle E}$ are the maximum immigration and emigration rates, respectively.

In BBO, ${\displaystyle \lambda _{k}}$ is the probability that a given independent variable in the ${\displaystyle k}$-th candidate solution will be replaced; that is, ${\displaystyle \lambda _{k}}$ is the immigration probability of ${\displaystyle x_{k}}$. If an independent variable is to be replaced, then the emigrating candidate solution is chosen with a probability that is proportional to the emigration probability ${\displaystyle \mu _{k}}$. This is usually performed using roulette wheel selection.

${\displaystyle {\text{Prob}}(x_{j}){\text{ is selected for emigration}}={\frac {\mu _{j}}{\sum _{i=1}^{N}\mu _{i}}}}$

for ${\displaystyle j=1,\cdots ,N}$, where ${\displaystyle N}$ is the number of candidate solutions in the population.

Algorithm

Like most other EAs, BBO includes mutation. A basic BBO algorithm with a population size of ${\displaystyle N}$ for optimizing an ${\displaystyle n}$-dimensional function can be described as follows.

Initialize a population of ${\displaystyle N}$ candidate solutions ${\displaystyle \{x_{k}\}}$ 
While not(termination criterion)
    For each ${\displaystyle x_{k}}$, set emigration probability ${\displaystyle \mu _{k}\propto }$ fitness of ${\displaystyle x_{k}}$, do
        with ${\displaystyle \mu _{k}\in [0,1]}$
    For each ${\displaystyle x_{k}}$, set immigration probability ${\displaystyle \lambda _{k}=1-\mu _{k}}$ do
    ${\displaystyle \{z_{k}\}\leftarrow \{x_{k}\}}$
    For each individual ${\displaystyle z_{k}(k=1,\cdots ,N)}$ do
        For each independent variable index ${\displaystyle s\in [1,n]}$ do
            Use ${\displaystyle \lambda _{k}}$ to probabilistically decide whether to immigrate to ${\displaystyle z_{k}}$
            If immigrating then
                Use ${\displaystyle \{\mu _{i}\}}$ to probabilistically select the emigrating individual ${\displaystyle x_{j}}$
                ${\displaystyle z_{k}(s)\leftarrow x_{j}(s)}$
            End if
        Next independent variable index: ${\displaystyle s\leftarrow s+1}$
        Probabilistically mutate ${\displaystyle z_{k}}$
    Next individual: ${\displaystyle k\leftarrow k+1}$
    ${\displaystyle \{x_{k}\}\leftarrow \{z_{k}\}}$
Next generation

Discussion of the BBO algorithm

• The population size ${\displaystyle N}$ is a tuning parameter. If ${\displaystyle N}$ is too small or too large, then the optimization performance of BBO will suffer. Typical implementations of BBO use a value of ${\displaystyle N}$ somewhere between 20 and 200.
• The initial population of candidate solutions ${\displaystyle \{x_{k}\}_{k=1}^{N}}$ is usually generated randomly. However, it could be generated in a problem-dependent way based on some reasonable guesses or previously-known good solutions to the optimization problem.
• The termination criterion is problem-dependent, like in any other EA. In most applications the termination criterion is a generation count limit or a function evaluation limit (that is, how often the objective function is evaluated).
• ${\displaystyle \{z_{k}\}}$ is a temporary population so that all emigrating variables can originate from the population that is in place at the beginning of the generation, which is ${\displaystyle \{x_{k}\}}$.

Algorithmic variations

Many variations have been proposed to the basic BBO algorithm, among which are the following.

• Elitism is implemented in most EAs to make sure that the best candidate solution is not lost from one generation to the next. This can be implemented in a variety of ways, but one common way is to save the best candidate solutions at the beginning of each generation in a set ${\displaystyle \mathbb {E} }$; then replace the worst candidate solutions with ${\displaystyle \mathbb {E} }$ at the end of the generation, after migration and mutation have completed. The size of ${\displaystyle \mathbb {E} }$ is a tuning parameter, but ${\displaystyle \mathbb {E} }$ typically includes the best two individuals. Elitism was originally proposed for genetic algorithms by DeJong.^[5] Elitism can make a significant difference in the performance of BBO, and is highly recommended.
• Duplicate replacement is often implemented in BBO. This is a procedure at the end of each generation that replaces duplicate individuals in the population. Scanning for duplicates can be computationally intensive because it is an ${\displaystyle O(N^{2})}$ operation, so it is often performed only every few generations, rather than every generation.
• Blending can be implemented in BBO. With blending, instead of replacing ${\displaystyle z_{k}(s)}$ in an immigrating candidate solution with ${\displaystyle x_{j}(s)}$ from the emigrating candidate solution, ${\displaystyle z_{k}(s)}$ is set equal to a linear combination of its original value and ${\displaystyle x_{j}(s)}$:

${\displaystyle z_{k}(s)\leftarrow \alpha z_{k}(s)+(1-\alpha )x_{j}(s)}$

where ${\displaystyle \alpha \in [0,1]}$, and ${\displaystyle \alpha =0}$ corresponds to standard migration as shown in the algorithm above. Blended BBO is based on blended crossover in genetic algorithms,^[6] and has been shown to outperform standard BBO.^[7]

• The BBO algorithm presented above is called partial immigration-based BBO because the immigrating candidate solution is selected before the emigrating candidate solution is selected, and migration for each independent variable in the immigrating candidate solution is performed independently of all other independent variables. Other approaches for selecting the immigrating and emigrating candidate solutions have also been proposed.^[8][9]
• The migration curves in the above figure are linear, but nonlinear migration curves often give better performance.^[10]

Hybridization

• BBO has been hybridized with several other EAs, including particle swarm optimization,^[9][11] differential evolution,^[12] evolution strategy,^[13] opposition-based computing,^[14] case-based reasoning,^[15] artificial bee colony algorithm, bacterial foraging optimization,^[16] harmony search,^[17] and the simplex algorithm.^[18]
• BBO can be combined with local search to create a memetic algorithm that performs much better than BBO alone.^[19]

Software

function BBO
% Biogeography-based optimization (BBO) to minimize a continuous function
% This program was tested with MATLAB R2012b

GenerationLimit = 50; % generation count limit 
PopulationSize = 50; % population size
ProblemDimension = 20; % number of variables in each solution (i.e., problem dimension)
MutationProbability = 0.04; % mutation probability per solution per independent variable
NumberOfElites = 2; % how many of the best solutions to keep from one generation to the next
MinDomain = -2.048; % lower bound of each element of the function domain
MaxDomain = +2.048; % upper bound of each element of the function domain

% Initialize the population
rng(round(sum(100*clock))); % initialize the random number generator
x = zeros(PopulationSize, ProblemDimension); % allocate memory for the population
for index = 1 : PopulationSize % randomly initialize the population
    x(index, :) = MinDomain + (MaxDomain - MinDomain) * rand(1, ProblemDimension);
end
Cost = RosenbrockCost(x); % compute the cost of each individual  
[x, Cost] = PopulationSort(x, Cost); % sort the population from best to worst
MinimumCost = zeros(GenerationLimit, 1); % allocate memory
MinimumCost(1) = Cost(1); % save the best cost at each generation in the MinimumCost array
disp(['Generation 0 min cost = ', num2str(MinimumCost(1))]);
z = zeros(PopulationSize, ProblemDimension); % allocate memory for the temporary population

% Compute migration rates, assuming the population is sorted from most fit to least fit
mu = (PopulationSize + 1 - (1:PopulationSize)) / (PopulationSize + 1); % emigration rate
lambda = 1 - mu; % immigration rate

for Generation = 1 : GenerationLimit
    % Save the best solutions and costs in the elite arrays
    EliteSolutions = x(1 : NumberOfElites, :);
    EliteCosts = Cost(1 : NumberOfElites);

    % Use migration rates to decide how much information to share between solutions
    for k = 1 : PopulationSize
        % Probabilistic migration to the k-th solution
        for j = 1 : ProblemDimension

            if rand < lambda(k) % Should we immigrate?
                % Yes - Pick a solution from which to emigrate (roulette wheel selection)
                RandomNum = rand * sum(mu);
                Select = mu(1);
                SelectIndex = 1;
                while (RandomNum > Select) && (SelectIndex < PopulationSize)
                    SelectIndex = SelectIndex + 1;
                    Select = Select + mu(SelectIndex);
                end
                z(k, j) = x(SelectIndex, j); % this is the migration step
            else
                z(k, j) = x(k, j); % no migration for this independent variable
            end

        end
    end

    % Mutation
    for k = 1 : PopulationSize
        for ParameterIndex = 1 : ProblemDimension
            if rand < MutationProbability
                z(k, ParameterIndex) = MinDomain + (MaxDomain - MinDomain) * rand;
            end
        end
    end

    x = z; % replace the solutions with their new migrated and mutated versions
    Cost = RosenbrockCost(x); % calculate cost
    [x, Cost] = PopulationSort(x, Cost); % sort the population and costs from best to worst

    for k = 1 : NumberOfElites % replace the worst individuals with the previous generation's elites
        x(PopulationSize-k+1, :) = EliteSolutions(k, :);
        Cost(PopulationSize-k+1) = EliteCosts(k);
    end

    [x, Cost] = PopulationSort(x, Cost); % sort the population and costs from best to worst
    MinimumCost(Generation+1) = Cost(1);
    disp(['Generation ', num2str(Generation), ' min cost = ', num2str(MinimumCost(Generation+1))])
end

% Wrap it up by displaying the best solution and by plotting the results
disp(['Best solution found = ', num2str(x(1, :))])
close all
plot(0:GenerationLimit, MinimumCost);
xlabel('Generation')
ylabel('Minimum Cost')
return

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
function [x, Cost] = PopulationSort(x, Cost)
% Sort the population and costs from best to worst
[Cost, indices] = sort(Cost, 'ascend');
x = x(indices, :);
return

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
function [Cost] = RosenbrockCost(x)
% Compute the Rosenbrock function value of each element in x
NumberOfDimensions = size(x, 2);
Cost = zeros(size(x, 1), 1); % allocate memory for the Cost array
for PopulationIndex = 1 : length(x)
    Cost(PopulationIndex) = 0;
    for i = 1 : NumberOfDimensions-1
        Temp1 = x(PopulationIndex, i);
        Temp2 = x(PopulationIndex, i+1);
        Cost(PopulationIndex) = Cost(PopulationIndex) + 100 * (Temp2 - Temp1^2)^2 + (Temp1 - 1)^2;
    end
end
return

Extensions

BBO has been extended to noisy functions (that is, functions whose fitness evaluation is corrupted by noise);^[21] constrained functions;^[22] combinatorial functions;^[23] and multi-objective functions.^[24][25] Moreover, a micro biogeography-inspired multi-objective optimization algorithm (μBiMO) was implemented: it is suitable for solving multi-objective optimisations in the field of industrial design because it is based on a small number of islands (hence the name μBiMO), i.e. few objective function calls are required.^[26]

Mathematical analyses

BBO has been mathematically analyzed using Markov models^[27] and dynamic system models.^[28]

Applications

Scholars have applied BBO into various academic and industrial applications. They found BBO performed better than state-of-the-art global optimization methods.

For example, Wang et al. proved BBO performed equal performance with FSCABC but with simpler codes.^[29]

Yang et al. showed BBO was superior to GA, PSO, and ABC.^[30]

References

External links

• BBO Home Page