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

Full description

Saved in:
Bibliographic Details
Published in:Knowledge-based systems Vol. 141; pp. 18 - 30
Main Authors: Zhou, Ying, Wang, Jiahai, Wu, Ziyan, Wu, Keke
Format: Journal Article
Language:English
Published: Elsevier B.V 01.02.2018
Subjects:
ISSN:0950-7051, 1872-7409
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first