Dynamic group optimization algorithm with a mean–variance search framework

•The proportioned mean solution generator can avoid fast shrinkage of search space.•Two significant difference individuals are perturbed to provide more useful information.•Population diversity is increased.•A lifespan selection operator is used to enhance the ability to avoid local optimum.•Compara...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Expert systems with applications Ročník 183; s. 115434
Hlavní autoři: Tang, Rui, Yang, Jie, Fong, Simon, Wong, Raymond, Vasilakos, Athanasios V., Chen, Yu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 30.11.2021
Elsevier BV
Témata:
Algorithms
Distribuerade datorsystem
Dynamic group optimization algorithm
Mean–variance search framework
Metaheuristic algorithm
Mutation
Optimization
Optimization algorithms
Pervasive Mobile Computing
Metaheuristic algorithm
Mean–variance search framework
Dynamic group optimization algorithm
ISSN:0957-4174, 1873-6793, 1873-6793
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í:•The proportioned mean solution generator can avoid fast shrinkage of search space.•Two significant difference individuals are perturbed to provide more useful information.•Population diversity is increased.•A lifespan selection operator is used to enhance the ability to avoid local optimum.•Comparative results of engineering problems in welded beam design show the promise of our algorithms for real-world applications. Dynamic group optimization has recently appeared as a novel algorithm developed to mimic animal and human socialising behaviours. Although the algorithm strongly lends itself to exploration and exploitation, it has two main drawbacks. The first is that the greedy strategy, used in the dynamic group optimization algorithm, guarantees to evolve a generation of solutions without deteriorating than the previous generation but decreases population diversity and limit searching ability. The second is that most information for updating populations is obtained from companions within each group, which leads to premature convergence and deteriorated mutation operators. The dynamic group optimization with a mean–variance search framework is proposed to overcome these two drawbacks, an improved algorithm with a proportioned mean solution generator and a mean–variance Gaussian mutation. The new proportioned mean solution generator solutions do not only consider their group but also are affected by the current solution and global situation. The mean–variance Gaussian mutation takes advantage of information from all group heads, not solely concentrating on information from the best solution or one group. The experimental results on public benchmark test suites show that the proposed algorithm is effective and efficient. In addition, comparative results of engineering problems in welded beam design show the promise of our algorithms for real-world applications.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0957-4174
1873-6793
1873-6793
DOI:10.1016/j.eswa.2021.115434