Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem

Metaheuristics have been widely utilized for solving NP-hard optimization problems. However, these algorithms usually perform differently from one problem to another, i.e., one may be effective on a problem but performs badly on another problem. Therefore, it is difficult to choose the best algorith...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied soft computing Jg. 81; S. 105485
Hauptverfasser:	Zhou, Ying, Kong, Lingjing, Wu, Ziyan, Liu, Shaopeng, Cai, Yiqiao, Liu, Ye
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.08.2019
Schlagworte:	Multi-objective optimization Multi-objective unconstrained binary quadratic programming problem Selection hyper-heuristic Multi-objective unconstrained binary quadratic programming problem Multi-objective optimization Selection hyper-heuristic
ISSN:	1568-4946, 1872-9681
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!