Fast,effective Heuristics For The 0-1 Multi-dimensional Knapsack Problem

摘要

The objective of the multi-dimensional knapsack problem (MKP) is to find a subset of items with maximum value that satisfies a number of knapsack constraints.Solution methods for MKP,both heuristic and exact,have been researched for several decades.This paper introduces several fast and effective heuristics for MKP that are based on solving the LP relaxation of the problem.Improving procedures are proposed to strengthen the results of these heuristics.Additionally,the heuristics are run with appropriate deterministic or randomly generated constraints imposed on the linear relaxation that allow generating a number of good solutions.All algorithms are tested experimentally on a widely used set of benchmark problem instances to show that they compare favourably with the best-performing heuristics available in the literature.