On the convergence of biogeography-based optimization for binary problems
From MaRDI portal
Publication:1717756
DOI10.1155/2014/147457zbMath1407.90368OpenAlexW2088987173WikidataQ59063207 ScholiaQ59063207MaRDI QIDQ1717756
Dan Simon, Haiping Ma, Min-Rui Fei
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/147457
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)
Cites Work
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Modeling genetic algorithms with Markov chains.
- Genetic algorithms: Principles and perpectives. A guide to GA theory
- On the convergence rates of genetic algorithms
- Convergence of an annealing algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the convergence of biogeography-based optimization for binary problems
