Discrete and continuous optimization based on hierarchical artificial bee colony optimizer

20Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a novel optimization algorithm, namely, hierarchical artificial bee colony optimization (HABC), to tackle complex high-dimensional problems. In the proposed multilevel model, the higher-level species can be aggregated by the subpopulations from lower level. In the bottom level, each subpopulation employing the canonical ABC method searches the part-dimensional optimum in parallel, which can be constructed into a complete solution for the upper level. At the same time, the comprehensive learning method with crossover and mutation operator is applied to enhance the global search ability between species. Experiments are conducted on a set of 20 continuous and discrete benchmark problems. The experimental results demonstrate remarkable performance of the HABC algorithm when compared with other six evolutionary algorithms. © 2014 Lianbo Ma et al.

Cite

CITATION STYLE

APA

Ma, L., Hu, K., Zhu, Y., Niu, B., Chen, H., & He, M. (2014). Discrete and continuous optimization based on hierarchical artificial bee colony optimizer. Journal of Applied Mathematics, 2014. https://doi.org/10.1155/2014/402616

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