Hypervolume-Based Multi-level Algorithm for the Bi-criteria Max-Cut Problem

Abstract

Abstract.The multi-level approach is known to be a highly effective metaheuristic framework for tackling several types of combinatorial optimization problems, which is one of the best performing approaches for the graph partitioning problems. In this paper, we integrate the multilevel approach into the hypervolume-based multi-objective local search algorithm, in order to solve the bi-criteria max-cut problem. The experimental results indicate that the proposed algorithm is very competitive, and the performance analysis sheds lights on the ways to further improvements.