The Multi-demand Multidimensional Knapsack Problem (MDMKP) is a challenging combinatorial task due to its capacity and demand constraints. Local search operators play a key role in metaheuristics when navigating such complex solution spaces, yet thei...
In order to minimize execution times, improve the quality of solutions, and address more extensive target situations, optimization techniques, particularly metaheuristics, are continually improved. Hybridizing procedures are one of these noteworthy s...
The Multi-Demand Multidimensional Knapsack Problem (MDMKP) combines upper-bound capacities and lower-bound demands, producing a restrictive feasible region. We study three swap-based repair-intensification policies in a common hybrid framework: light...