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...

Celý popis

Podrobná bibliografie

Vydáno v:	Applied soft computing Ročník 81; s. 105485
Hlavní autoři:	Zhou, Ying, Kong, Lingjing, Wu, Ziyan, Liu, Shaopeng, Cai, Yiqiao, Liu, Ye
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.08.2019
Témata:	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
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!