Chaotic Evolution Algorithm with Elite Strategy in Single-objective and Multi-objective Optimization

We propose a chaotic evolution algorithm with elite strategy. The conventional chaotic evolution algorithm uses each individual to search in its local area. The proposed algorithm searches the parameter space always around the elite individual from the last generation. We evaluate the proposed algor...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics s. 579 - 584
Hlavní autor: Pei, Yan
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 11.10.2020
Témata:
Benchmark testing
chaotic evolution
Conferences
Cybernetics
elite strategy
multi-objective optimization
Optimization
single-objective optimization
ISSN:2577-1655
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a chaotic evolution algorithm with elite strategy. The conventional chaotic evolution algorithm uses each individual to search in its local area. The proposed algorithm searches the parameter space always around the elite individual from the last generation. We evaluate the proposed algorithm in both single-objective and multi-objective optimization problems. In the single objective optimization problem, the elite is the individual has the best fitness value, and in the multi-objective optimization problem, the elites are the individuals in the first Pareto front. We design and evaluate these two algorithms with elite strategy using single- and multi-objective benchmark functions. We design a jump strategy to avoid searching within a local optima areas by applying elite strategy several generations one time. The numerical evaluation results demonstrate the proposed algorithm has strong local exploitation capability in the early generations. The optimization performance of chaotic evolution algorithm has a potential possibility to apply in high dimensional and more complex optimization problems.
ISSN:2577-1655
DOI:10.1109/SMC42975.2020.9283144