##
**Multi-operator based biogeography based optimization with mutation for global numerical optimization.**
*(English)*
Zbl 1268.90150

Summary: Biogeography based optimization (BBO) is a new evolutionary optimization based on the science of biogeography for global optimization. We propose two extensions to BBO. First, we propose a new migration operation based multi-parent crossover called multi-parent migration model, which is a generalization of the standard BBO migration operator. The new migration model can satisfy a balance of exploration and exploitation. Second, the Gaussian mutation operator is integrated into multi-operator biogeography based optimization (MOBBO) to enhance its exploration ability and to improve the diversity of population. Experiments have been conducted on 23 benchmark problems of a wide range of dimensions and diverse complexities. Simulation results and comparisons demonstrate the proposed MOBBO algorithm based multi-parent crossover model is better, or at least comparable to, the BBO, PBBO and evolutionary algorithms from literature when considering the quality of the solutions obtained.

### MSC:

90C59 | Approximation methods and heuristics in mathematical programming |

65K10 | Numerical optimization and variational techniques |

90C26 | Nonconvex programming, global optimization |

### Keywords:

biogeography based optimization; multi-parent crossover operator; global numerical optimization; exploration; exploitation### Software:

JADE
PDF
BibTeX
XML
Cite

\textit{X. Li} and \textit{M. Yin}, Comput. Math. Appl. 64, No. 9, 2833--2844 (2012; Zbl 1268.90150)

Full Text:
DOI

### References:

[1] | Lawler, E.L.; Wood, D.E., Branch-and-bound methods: a survey, Operations research, 14, 699-719, (1966) · Zbl 0143.42501 |

[2] | Glover, F.; Kochenberger, G., Handbook of meta-heuristics, (2003), Kluwer Boston |

[3] | Bellman, R., On the theory of dynamic programming, Proceedings of the national Academy of sciences, 38, 716-719, (1952) · Zbl 0047.13802 |

[4] | Snyman, J.A., Practical mathematical optimization: an introduction to basic optimization theory and classical and new gradient-based algorithms, (2004), Kluwer Academic Publishers Dordrect, The Netherlands |

[5] | Suman, B., Study of simulated annealing based algorithms for multiobjective optimization of a constrained problem, Computers & chemical engineering, 8, 1849-1871, (2004) |

[6] | Horn, J.; Nafpliotis, N.; Goldberg, D.E., A niched Pareto genetic algorithm for multiobjective optimization, Evolutionary computation, 1, 82-87, (1994) |

[7] | Reid, D.J., Genetic algorithms in constrained optimization, Mathematical, 3, 87-111, (1996) · Zbl 0852.90118 |

[8] | Kalinlia, A.; Karabogab, N., Artificial immune algorithm for IIR filter design, Engineering applications of artificial intelligence, 18, 919-929, (2005) |

[9] | Bergh, F.V.D.; Engelbrecht, A.P., A study of particle swarm optimization particle trajectories, Information sciences, 176, 937-971, (2006) · Zbl 1093.68105 |

[10] | Clerc, M.; Kennedy, J., The particle swarm-explosion, stability, and convergence in a multidimensional complex space, IEEE transactions on evolutionary computation, 6, 58-73, (2002) |

[11] | Du, W.; Li, B., Multi-strategy ensemble particle swarm optimization for dynamic optimization, Information sciences, 178, 3096-3109, (2008) · Zbl 1283.90047 |

[12] | J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Pro. of the IEEE Inter. Joint Conf. on Neu. Net., 4, 1995, pp. 1942-1948. |

[13] | Dorigo, M.; Maniezzo, V.; Colorni, A., The ant system: optimization by a colony of cooperating agents, IEEE transactions on systems, man and cybernetics, part B, 26, 1, 29-41, (1996) |

[14] | Ellabib, I.; Calamai, P.; Basir, O., Exchange strategies for multiple ant colony system, Information sciences, 177, 1248-1264, (2007) |

[15] | Zhang, Jingqiao; Sanderson, Arthur C., JADE: adaptive differential evolution with optional external archive, IEEE transactions on evolutionary computation, 13, 5, 945-958, (2009) |

[16] | Storn, R.; Price, K., Differential evolution—a simple and efficient heuristic for global optimization over continuous space, Journal of global optimization, 11, 341-359, (1997) · Zbl 0888.90135 |

[17] | Qian, W.Y.; Li, A.J., Adaptive differential evolution algorithm for multiobjective optimization problems, Applied mathematics and computation, 5, 431-440, (2008) · Zbl 1148.65042 |

[18] | Simon, D., Biogeography-based optimization, IEEE transactions on evolutionary computation, 12, 6, 702-713, (2008) |

[19] | Simon, D.; Rarick, R.; Ergezer, M.; Du, D., Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms, Information sciences, (2010) |

[20] | Zhang, Q.; Muhlenbein, H., On the convergence of a class of estimation of distribution algorithms, IEEE transactions on evolutionary computation, 8, 127-136, (2004) |

[21] | Zhang, Q.; Sun, J.; Tsang, E.; Ford, J., Hybrid estimation of distribution algorithm for global optimization, Engineering with computers, 21, 91-107, (2004) · Zbl 1089.90023 |

[22] | D. Du, D. Simon, M. Ergezer, Biogeography-based optimization combined with evolutionary strategy and immigration refusal, in: IEEE Conference on Systems, Man, and Cybernetics, San Antonio, Texas, October 2009, pp. 1023-1028. |

[23] | M. Ergezer, D. Simon, D. Du, Oppositional biogeography-based optimization, in: IEEE Conference on Systems, Man, and Cybernetics, San Antonio, Texas, October 2009, pp. 1035-1040. |

[24] | Boussaïd, I.; Chatterjee, A.; Siarry, P.; Ahmed-Nacer, M., Two-stage update biogeography-based optimization using differential evolution algorithm (DBBO), Computers & operations research, 38, 8, 1188-1198, (2011) · Zbl 1208.90195 |

[25] | Gong, W.; Cai, Z.; Ling, C.; Li, H., A real-coded biogeography-based optimization with mutation, Applied mathematics and computation, 216, 9, 2749-2758, (2010) · Zbl 1206.90221 |

[26] | Simon, D., A probabilistic analysis of a simplified biogeography-based optimization algorithm, Evolutionary computation, (2010) |

[27] | S.M. Elsayed, R.A. Sarker, D.L. Essam, GA with a new multi-parent crossover for solving IEEE-CEC2011 competition problems, in: Proceeding IEEE Congress on Evolutionary Computation, 2011, pp. 1034-1040. |

[28] | Elsayed, S.M.; Sarker, R.A.; Essam, D.L., Multi-operator based evolutionary algorithms for solving constrained optimization problems, Computers and operations research, 38, 12, 1877-1896, (2011) · Zbl 1215.90051 |

[29] | Feller, W., An introduction to probability theory and its applications, vol. 2, (1971), Wiley NewYork · Zbl 0219.60003 |

[30] | Li, X.; Wang, J.; Zhou, J.; Yin, M., A perturb biogeography based optimization with mutation for global numerical optimization, Applied mathematics and computation, 218, 2, 207-650, (2011) |

[31] | Yao, X.; Liu, Y.; Lin, G., Evolutionary programming made faster, IEEE transactions on evolutionary computation, 3, 2, 82-102, (1999) |

[32] | Lee, C.Y.; Yao, X., Evolutionary programming using mutations based on the Lévy probability distribution, IEEE transactions on evolutionary computation, 8, 1, 1-13, (2004) |

[33] | Liang, J.J.; Qin, A.K.; Suganthan, P.N.; Baskar, S., Comprehensive learning particle swarm optimizer for global optimization of multimodal functions, IEEE transactions on evolutionary computation, 10, 3, 281-295, (2006) |

[34] | Hansen, N.; Ostermeier, A., Completely derandomized self adaptation in evolution strategies, Evolutionary computation, 9, 2, 159-195, (2001) |

[35] | Garcia-Martinez, C.; Lozano, M.; Herrera, F.; Molina, D.; Sanchez, A.M., Global and local real-coded genetic algorithms based on parent-centric crossover operators, European journal of operational research, 185, 1088-1113, (2008) · Zbl 1146.90532 |

[36] | Noman, N.; Iba, H., Accelerating differential evolution using an adaptive local search, IEEE transactions on evolutionary computation, 12, 1, 107-125, (2008) |

[37] | Rahnamayan, S.; Tizhoosh, H.R.; Salama, M.M.A., Opposition-based differential evolution, IEEE transactions on evolutionary computation, 12, 1, 64-79, (2008) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.