Neural Multi-Objective Combinatorial Optimization with Diversity
  Enhancement
Jinbiao Chen Zizhen Zhang Zhiguang Cao Yaoxin Wu Yining Ma Te Ye Jiahai Wang
Most of existing neural methods for multi-objective combinatorial
optimization (MOCO) problems solely rely on decomposition, which often leads to
repetitive solutions for the respective subproblems, thus a limited Pareto set.
Beyond decomposition, we propose a novel neural heuristic with diversity
enhancement (NHDE) to produce more Pareto solutions from two perspectives. On
the one hand, to hinder duplicated solutions for different subproblems, we
propose an indicator-enhanced deep reinforcement learning method to guide the
model, and design a heterogeneous graph attention mechanism to capture the
relations between the instance graph and the Pareto front graph. On the other
hand, to excavate more solutions in the neighborhood of each subproblem, we
present a multiple Pareto optima strategy to sample and preserve desirable
solutions. Experimental results on classic MOCO problems show that our NHDE is
able to generate a Pareto front with higher diversity, thereby achieving
superior overall performance. Moreover, our NHDE is generic and can be applied
to different neural methods for MOCO.