Hybrid achievement oriented computational chemotaxis in bacterial foraging optimization: a comparative study on numerical benchmark
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469334 | ||
| 003 | CHVBK | ||
| 005 | 20210128100321.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-015-1687-4 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-015-1687-4 | ||
| 245 | 0 | 0 | |a Hybrid achievement oriented computational chemotaxis in bacterial foraging optimization: a comparative study on numerical benchmark |h [Elektronische Daten] |c [Y. Yıldız, Oğuz Altun] |
| 520 | 3 | |a The social foraging behavior of Escherichia coli bacteria has been recently used for solving complex real-world search and optimization problems. Bacterial foraging optimization algorithm (BFOA) is an important global optimization method inspired from this behavior. In this paper, a novel method called chemotaxis differential evolution optimization algorithm (CDEOA), which augments BFOA with conditional introduction of differential evolution (DE) and Random Search operators, is proposed. Introduction of these operators is done considering the number of successful run and unsuccessful tumble steps of bacteria. CDEOA was compared with the classical BFOA, two variants of BFOA which use DE operators [Adaptive Chemotactic Bacterial Swarm Foraging Optimization with Differential Evolution Strategy (ACBSFO_DES)], chemotaxis differential evolution (CDE), and the classical DE on all 30 numerical functions of the 2014 Congress on Evolutionary Computation (CEC 2014) Special Session and Competition on Single Objective Real Parameter Numerical Optimization suite. CDEOA was also compared with four state-of-the-art DE variants that competed in CEC 2014. Statistics of the computer simulations over this benchmark suite indicate that CDEOA outperforms, or is comparable to, its competitors in terms of the quality of final solution and its convergence rates for high-dimensional problems. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2015 | ||
| 690 | 7 | |a Bacterial foraging optimization algorithm |2 nationallicence | |
| 690 | 7 | |a Differential evolution |2 nationallicence | |
| 690 | 7 | |a Nature-inspired algorithms |2 nationallicence | |
| 690 | 7 | |a Hybrid BFOA |2 nationallicence | |
| 690 | 7 | |a Metaheuristics |2 nationallicence | |
| 700 | 1 | |a Yıldız |D Y. |u Department of Computer Engineering, Epoka University, Tirana, Albania |4 aut | |
| 700 | 1 | |a Altun |D Oğuz |u Department of Computer Engineering, Yildiz Technical University, Istanbul, Turkey |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3647-3663 |x 1432-7643 |q 19:12<3647 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-015-1687-4 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-015-1687-4 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Yıldız |D Y. |u Department of Computer Engineering, Epoka University, Tirana, Albania |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Altun |D Oğuz |u Department of Computer Engineering, Yildiz Technical University, Istanbul, Turkey |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3647-3663 |x 1432-7643 |q 19:12<3647 |1 2015 |2 19 |o 500 | ||