返回
Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem
DOI:10.1109/ACCESS.2025.3529317.png)
摘要
En 中文
The quadratic multiple knapsack problem (QMKP) is a well-studied problem in operations research. This problem involves selecting a subset of items that maximizes the linear and quadratic profit without exceeding a set of capacities for each knapsack. While its solution using metaheuristics has been explored, exact approaches have recently been investigated. One way to improve the performance of these exact approaches is by reducing the solution space in different instances, considering the properties of the items in the context of QMKP. In this paper, machine learning (ML) models are employed to support an exact optimization solver by predicting the inclusion of items with a certain level of confidence and classifying them. This approach reduces the solution space for exact solvers, allowing them to tackle more manageable problems. The methodological process is detailed, in which ML models are generated and the best one is selected to be used as a preprocessing approach. Finally, we conduct comparison experiments, demonstrating that using a ML model is highly beneficial for reducing computing times and achieving rapid convergence.
Keyword:
Classification algorithms
Prediction algorithms
Metaheuristics
Genetic algorithms
Synthetic data
Heuristic algorithms
Correlation
Support vector machines
Standards
Mathematical models
Machine learning
combinatorial optimization
knapsack problem
quadratic multiple knapsack problem
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Growth, Morphological, and Chemical Component Responses of Tall Fescue to Acremonium coenophialum
Crop Science
IF0
Neural Knapsack: A Neural Network Based Solver for the Knapsack Problem神经背包: 基于神经网络的背包问题求解器
IEEE ACCESS
IF3.6
Transformation of organic rhizodepositions by rhizosphere bacteria and its influence on the availability of tertiary calcium phosphate.根际细菌对有机根际沉积的转化及其对叔磷酸钙有效性的影响。
Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems背包问题-最新进展概述。第二部分: 多重、多维和二次背包问题

