Adaptive memory search for multidemand multidimensional knapsack problems


We describe a simple adaptive memory search method for the 0/1 Multidemand Multidimensional Knapsack Problem (0/1 MDMKP). The search balances the level of infeasibility against the quality of the solution, and uses a simple dynamic tabu search mechanism. A weighting scheme to balance out the differences in the tightness of the constraints is also implemented. Computational results on a portfolio of test problems taken from the literature are reported, showing very favorable results, both in terms of solution quality and the ability of the search to find feasible solutions. 2005 Elsevier Ltd. All rights reserved.

DOI: 10.1016/j.cor.2005.07.007

8 Figures and Tables

Cite this paper

@article{Arntzen2006AdaptiveMS, title={Adaptive memory search for multidemand multidimensional knapsack problems}, author={Halvard Arntzen and Lars Magnus Hvattum and Arne L\okketangen}, journal={Computers & OR}, year={2006}, volume={33}, pages={2508-2525} }