Bird mating optimizer: An optimization algorithm inspired by bird mating strategies

Abstract Thanks to their simplicity and flexibility, evolutionary algorithms (EAs) have attracted significant attention to tackle complex optimization problems. The underlying idea behind all EAs is the same and they differ only in technical details. In this paper, we propose a novel version of EAs, bird mating optimizer (BMO), for continuous optimization problems which is inspired by mating strategies of bird species during mating season. BMO imitates the behavior of bird species metaphorically to breed broods with superior genes for designing optimum searching techniques. On a large set of unimodal and multimodal benchmark functions, BMO represents a competitive performance to other EAs.

[1]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[2]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[3]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[4]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.

[5]  Alireza Rezazadeh,et al.  Artificial neural network training using a new efficient optimization algorithm , 2013, Appl. Soft Comput..

[6]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[7]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[8]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[9]  Yuping Wang,et al.  An orthogonal genetic algorithm with quantization for global numerical optimization , 2001, IEEE Trans. Evol. Comput..

[10]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[11]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[12]  Hongfei Teng,et al.  Cooperative Co-evolutionary Differential Evolution for Function Optimization , 2005, ICNC.

[13]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[14]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[16]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[17]  Luís N. Vicente,et al.  A particle swarm pattern search method for bound constrained global optimization , 2007, J. Glob. Optim..

[18]  Luís N. Vicente,et al.  PSwarm: a hybrid solver for linearly constrained global derivative-free optimization , 2009, Optim. Methods Softw..

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[20]  Alireza Rezazadeh,et al.  A new heuristic optimization algorithm for modeling of proton exchange membrane fuel cell: bird mating optimizer , 2013 .

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  Tung-Kuan Liu,et al.  Hybrid Taguchi-genetic algorithm for global numerical optimization , 2004, IEEE Transactions on Evolutionary Computation.

[23]  Q. Henry Wu,et al.  Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior , 2009, IEEE Transactions on Evolutionary Computation.