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

Full description

Bibliographic Details

Published in:	Applied soft computing Vol. 81; p. 105485
Main Authors:	Zhou, Ying, Kong, Lingjing, Wu, Ziyan, Liu, Shaopeng, Cai, Yiqiao, Liu, Ye
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2019
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!