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 multiobjective 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.
CITATION STYLE
Huo, C., Zeng, R. Q., Wang, Y., & Shang, M. S. (2016). An effective genetic algorithm with uniform crossover for Bi-objective unconstrained binary quadratic programming problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9937 LNCS, pp. 58–67). Springer Verlag. https://doi.org/10.1007/978-3-319-46257-8_7
Mendeley helps you to discover research relevant for your work.