Name
Abstract | ||
|---|---|---|
Memetic computation (MC) has emerged recently as a new paradigm of efficient algorithms for solving the hardest optimization problems. On the other hand, artificial bees colony (ABC) algorithms demonstrate good performances when solving continuous and combinatorial optimization problems. This study tries to use these technologies under the same roof. As a result, a memetic ABC (MABC) algorithm has been developed that is hybridized with two local search heuristics: the Nelder-Mead algorithm (NMA) and the random walk with direction exploitation (RWDE). The former is attended more towards exploration, while the latter more towards exploitation of the search space. The stochastic adaptation rule was employed in order to control the balancing between exploration and exploitation. This MABC algorithm was applied to a Special suite on Large Scale Continuous Global Optimization at the 2012 IEEE Congress on Evolutionary Computation. The obtained results the MABC are comparable with the results of DECC-G, DECC-G*, and MLCC. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/CEC.2012.6252938 | 2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) |
Keywords | DocType | Volume |
convergence,evolutionary computation,algorithm design and analysis,memetics,measurement,optimization | Conference | abs/1206.1074 |
Citations | PageRank | References |
11 | 0.63 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Iztok Fister | 1 | 552 | 39.46 |
| Iztok Fister Jr. | 2 | 447 | 35.34 |
| Janez Brest | 3 | 2190 | 90.76 |
| Viljem Zumer | 4 | 268 | 21.78 |