An Effective Genetic Algorithm with Uniform Crossover for Bi-objective Unconstrained Binary Quadratic Programming Problem

摘要

The unconstrained binary quadratic programming problem is one of the most studied NP-hard problem with its various practical applications. In this paper, we propose an effective multi-objective genetic algorithm with uniform crossover for solving bi-objective unconstrained binary quadratic programming problem. In this algorithm, we integrate the uniform crossover within the hypervolume-based multi-objective optimization framework for further improvements. The computational studies on 10 benchmark instances reveal that the proposed algorithm is very effective in comparison with the original multi-objective optimization algorithms.