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

Celý popis

Podrobná bibliografia

Vydané v:	Knowledge-based systems Ročník 141; s. 18 - 30
Hlavní autori:	Zhou, Ying, Wang, Jiahai, Wu, Ziyan, Wu, Keke
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2018
Predmet:	Decomposition Multi-objective optimization Tabu search Tabu search Multi-objective optimization Decomposition
ISSN:	0950-7051, 1872-7409
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!