点击次数：

所属单位：计算机科学与技术学院/人工智能学院/软件学院

发表刊物：IEEE Trans. Cybern.

摘要：Combinatorial multiobjective optimization problems (CMOPs) are very popular due to their widespread applications in the real world. One common method for CMOPs is Pareto local search (PLS), a natural extension of single-objective local search (LS). However, classical PLS tends to reserve all of the nondominated solutions for LS, which causes the inefficient LS, as well as unbearable computational and space cost. Due to the aforementioned reasons, most PLS approaches can only handle CMOPs with no more than two objectives. In this paper, by combining the Pareto dominance and weighted sum (WS) approach in a grid system, the grid weighted sum dominance (gws-dominance) is proposed and integrated into PLS for CMOPs with multiple objectives. In the grid system, at most one representative solution is maintained in each grid for more efficient LS, thus largely reducing the computational and space complexity. The grid-based WS approach can further guide the LS in different grids for maintaining more widely and uniformly distributed Pareto front approximations. In the experimental studies, the grid WS PLS is compared with the classical PLS, three decomposition-based LS approaches [multiobjective evolutionary algorithm based on decomposition-LS (WS, Tchebycheff, and penalty-based boundary intersection)], a grid-based algorithm (ϵ-MOEA), and a state-of-the-art hybrid approach (multiobjective memetic algorithm based on decomposition) on two sets of benchmark CMOPs. The experimental results show that the grid weighted sum Pareto local search significantly outperforms the compared algorithms and remains effective and efficient on combinatorial multiobjective and even many-objective optimization problems. © 2018 IEEE.

ISSN号：2168-2267

是否译文：否

发表时间：2019-09-01

合写作者：Sun, Haoran,Zhang, Qingfu,黄玉划

通讯作者：蔡昕烨