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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Khan, S., Kin, F.L., Manning, E., Akbar, M.: Solving the Knapsack Problem for Adaptive Multimedia Systems. Studia Informatica 2(1), 154–174 (2002); Special Issue on Combinatorial Problems
Chantzara, M., Anagnostou, M.: Evaluation and Selection of Context Information. In: Proceedings of the 2nd International Workshop on Modelling and Retrieval of Context (MRC 2005), Edinburgh, Scotland, July 31- August 1. CEUR Workshop Proceedings (2005) ISSN 1613-0073
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley-Inrescience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Chichester (1990)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems, p. 546. Springer, Heidelberg (2004) ISBN: 3-540-40286-1
Khan, S.: Quality Adaptation in a Multi-Session Adaptive Multimedia System: Model, Algorithms and Architecture. PhD Thesis, Department of Electronical and Computer Engineering, University of Victoria, Canada (1998)
Moser, M., Jokanovic, D., Shiratori, N.: An Algorithm for the Multidimensional Multiple-Choice Knapsack Problem. IECE Trans Fundamentals Electron 80, 582–589 (1997)
Toyoda, Y.: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-one Programming Problems. Management Science 21(12), 1417–1427 (1975)
Akbar, M., Rahman, M., Kaykobad, M., Manning, E., Shoja, G.: Solving the Multidimensional Multiple-choice Knapsack Problem by Constructing Convex Hulls. Computers & Operations Research 33(5), 1259–1273 (2006)
Hifi, M., Micrafy, M., Sbihi, A.: Heuristic Algorithms for the Multiple-choice Multidimensional Knapsack Problem. Journal of the Operational Research Society 55, 1323–1332 (2004)
Pisinger, D.: Where are the hard knapsack problems? Computers and Operations Research 32(9), 2271–2284 (2005)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chantzara, M., Anagnostou, M. (2006). MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758501_78
Download citation
DOI: https://doi.org/10.1007/11758501_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34379-0
Online ISBN: 978-3-540-34380-6
eBook Packages: Computer ScienceComputer Science (R0)