Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem

Authors:
Krzysztof Fleszar;Khalil S. Hindi
Affiliations:
Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon;Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon
Venue:
Computers and Operations Research
Year:
2009

Citing 5
Cited 3

An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Computationally Manageable Combinatorial Auctions

Computationally Manageable Combinatorial Auctions
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

Management Science
A hybrid approach for the 0-1 multidimensional knapsack problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Kernel search: A general heuristic for the multi-dimensional knapsack problem

Computers and Operations Research
A strategy-oriented operation module for recommender systems in E-commerce

Computers and Operations Research
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.