On the convergence of biogeography-based optimization for binary problems

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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. © 2014 Haiping Ma et al.

Cite

CITATION STYLE

APA

Ma, H., Simon, D., & Fei, M. (2014). On the convergence of biogeography-based optimization for binary problems. Mathematical Problems in Engineering, 2014. https://doi.org/10.1155/2014/147457

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free