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

作者：

Highlights：

• 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 approaches are designed.

• Experiments are carried out to demonstrate the effectiveness of two main components mentioned above.

• Experimental results show that DMTS significantly outperforms the state-of-the-art algorithms on 50 benchmark instances.

摘要

•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 approaches are designed.•Experiments are carried out to demonstrate the effectiveness of two main components mentioned above.•Experimental results show that DMTS significantly outperforms the state-of-the-art algorithms on 50 benchmark instances.

论文关键词：Multi-objective optimization,Decomposition,Tabu search

论文评审过程：Received 11 July 2017, Revised 5 November 2017, Accepted 8 November 2017, Available online 15 November 2017, Version of Record 19 December 2017.

论文官网地址：https://doi.org/10.1016/j.knosys.2017.11.009