On the convergence of biogeography-based optimization for binary problems

DOI10.1155/2014/147457MaRDI QIDQ1717756zbMATH OpenOpenAlexWikidataFDO

Authors Haiping Ma, Dan Simon, Minrui Fei

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/147457

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Biogeography-based optimization (BBO) is an evolutionary algorithm inspired by biogeography, which is the study of the migration of species between habitats. A finite Markov chain model of BBO for binary problems was derived in earlier work, and some significant theoretical results were obtained. This paper analyzes the convergence properties of BBO on binary problems based on the previously derived BBO Markov chain model. Analysis reveals that BBO with only migration and mutation never converges to the global optimum. However, BBO with elitism, which maintains the best candidate in the population from one generation to the next, converges to the global optimum. In spite of previously published differences between genetic algorithms (GAs) and BBO, this paper shows that the convergence properties of BBO are similar to those of the canonical GA. In addition, the convergence rate estimate of BBO with elitism is obtained in this paper and is confirmed by simulations for some simple representative problems.

Recommendations

• Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
• An analysis of the equilibrium of migration models for biogeography-based optimization
• Ecogeography-based optimization: enhancing biogeography-based optimization with ecogeographic barriers and differentiations
• Biogeography-based optimization for constrained optimization problems
• A perturb biogeography based optimization with mutation for global numerical optimization

Cites work

• Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
• Analyzing evolutionary algorithms. The computer science perspective.
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Convergence of an annealing algorithm
• Genetic algorithms: Principles and perpectives. A guide to GA theory
• scientific article; zbMATH DE number 3680816 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• Modeling genetic algorithms with Markov chains.
• On the convergence rates of genetic algorithms
• The unified method analyzing convergence of genetic algorithms

Cited in

(6)

• Biogeography-based optimisation and ecological optimisation
• Ecogeography-based optimization: enhancing biogeography-based optimization with ecogeographic barriers and differentiations
• Biogeography-based optimization for constrained optimization problems
• Convergence rates of SMS-EMOA on continuous bi-objective problem classes
• Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
• An analysis of the equilibrium of migration models for biogeography-based optimization

This page was built for publication: On the convergence of biogeography-based optimization for binary problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717756)