MVRC heuristic for solving the multi-choice multi-constraint knapsack problem

Authors:
Maria Chantzara;Miltiades Anagnostou
Affiliations:
School of Electrical & Computer Engineering, National Technical University of Athens, Zografou, Athens, Greece;School of Electrical & Computer Engineering, National Technical University of Athens, Zografou, Athens, Greece
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 5
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Introduction to Algorithms

Introduction to Algorithms
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture

Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Where are the hard knapsack problems?

Computers and Operations Research
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls

Computers and Operations Research

Hard multidimensional multiple choice knapsack problems, an empirical study

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the heuristic algorithm Maximizing Value per Resources Consumption (MVRC) that solves the Multi-Choice Multi-Constraint Knapsack Problem, a variant of the known NP-hard optimization problem called Knapsack problem. Starting with an initial solution, the MVRC performs iterative improvements through exchanging the already picked items in order to conclude to the optimal solution. Following a three step procedure, it tries to pick the items with the maximum Value per Aggregate Resources Consumption. The proposed algorithm has been evaluated in terms of the quality of the final solution and its run-time performance.