A Hybrid Machine Learning Method for Solving the Set Union Knapsack Problem

In this research paper, the set union knapsack problem, a more complex variant of the binary knapsack problem, is studied. A hybrid algorithm is proposed, combining machine learning with an iterative search-descent method. This hybrid algorithm is composed of three phases: learning, exploitation, and exploration strategies, which work together to provide high-quality solutions. The algorithm’s effectiveness is demonstrated through a computational analysis of benchmark instances from the literature, highlighting its competitiveness against existing methods.