Adaptive Scoring-and-Memory Policies for Repair Intensification in the Multi-Demand Multidimensional Knapsack Problem: A Comparative Analysis of Solution Quality and Trajectory Diversity
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: lightweight Hash tabu search, randomly sampled tabu search, and online lear...