A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem

•A multi-objective tabu search algorithm based on decomposition (DMTS) is proposed for multi-objective unconstrained binary quadratic programming problem.•To enhance the convergence and diversity properties of the proposed algorithm, uniform generation method and adaptive use of scalarizing approach...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Knowledge-based systems Jg. 141; S. 18 - 30
Hauptverfasser:	Zhou, Ying, Wang, Jiahai, Wu, Ziyan, Wu, Keke
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.02.2018
Schlagworte:	Decomposition Multi-objective optimization Tabu search Tabu search Multi-objective optimization Decomposition
ISSN:	0950-7051, 1872-7409
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!