Discrete and continuous optimization based on hierarchical artificial bee colony optimizer (Q1714592): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59051234, #quickstatements; #temporary_batch_1711196317277 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2014/402616 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084119038 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59051234 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:41, 23 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Discrete and continuous optimization based on hierarchical artificial bee colony optimizer |
scientific article |
Statements
Discrete and continuous optimization based on hierarchical artificial bee colony optimizer (English)
0 references
1 February 2019
0 references
Summary: 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.
0 references