Knapsack Balancing Via Multiobjectivization

In this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficients of the optimal solution can be undesirable, we propose, when appropriate, to control this effect through problem multiobjectivization. By multiobjectivization, we mean the addition of one or more objective functions that aim to shift the original problem’s optimal solutions towards Pareto optimal solutions of the multiobjectivized problem, reducing the dispersion of the respective coefficients. We detail how the knapsack balance aspect can be incorporated into the standard knapsack problem model and demonstrate the functionality of this enriched model through illustrative examples.