Surrogate-assisted evolutionary algorithm for expensive constrained multi-objective discrete optimization problems

Surrogate-assisted optimization has attracted much attention due to its superiority in solving expensive optimization problems. However, relatively little work has been dedicated to addressing expensive constrained multi-objective discrete optimization problems although there are many such problems...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Complex & intelligent systems Jg. 8; H. 4; S. 2699 - 2718
Hauptverfasser: Gu, Qinghua, Wang, Qian, Xiong, Neal N., Jiang, Song, Chen, Lu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.08.2022
Springer Nature B.V
Schlagworte:
Complexity
Computational Intelligence
Data Structures and Information Theory
Engineering
Evolutionary algorithms
Genetic algorithms
Multiple objective analysis
Optimization
Original Article
Random forest
Constrained multi-objective discrete optimization problems
Stochastic ranking strategy
Surrogate model
Strength pareto evolutionary algorithm
Data-driven optimization
ISSN:2199-4536, 2198-6053
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Surrogate-assisted optimization has attracted much attention due to its superiority in solving expensive optimization problems. However, relatively little work has been dedicated to addressing expensive constrained multi-objective discrete optimization problems although there are many such problems in the real world. Hence, a surrogate-assisted evolutionary algorithm is proposed in this paper for this kind of problem. Specifically, random forest models are embedded in the framework of the evolutionary algorithm as surrogates to improve approximate accuracy for discrete optimization problems. To enhance the optimization efficiency, an improved stochastic ranking strategy based on the fitness mechanism and adaptive probability operator is presented, which also takes into account both convergence and diversity to advance the quality of candidate solutions. To validate the proposed algorithm, it is comprehensively compared with several well-known optimization algorithms on several benchmark problems. Numerical experiments are demonstrated that the proposed algorithm is very promising for the expensive constrained multi-objective discrete optimization problems.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2199-4536
2198-6053
DOI:10.1007/s40747-020-00249-x