Improved Weighted 0-1 Knapsack Method (WKM) to Optimize Resource Allocation

Authors

  • Maha A. Hammood Alrawi Department of Computer Science, University of Technology, Baghdad, Iraq https://orcid.org/0000-0003-3041-3909
  • Israa Tahseen Ali Department of Computer Science, University of Technology, Baghdad, Iraq
  • Olaa Amer Saied Department of Computer Science, University of Technology, Baghdad, Iraq

Keywords:

knapsack problem, dynamic programming, optimal solution, resource allocation

Abstract

In this paper an improved weighted 0-1 knapsack method (WKM) is proposed to optimize the resource allocation process when the sum of items' weight exceeds the knapsack total capacity .The improved method depends on a modified weight for each item to ensure the allocation of the required resources for all the involved items. The results of the improved WKM are compared to the traditional 0-1 Knapsack Problem (KP). The proposed method dominates on the other one in term of the total optimal solution value of the knapsack .

Downloads

Download data is not yet available.

Downloads

Published

2022-01-18

Issue

Vol 58 No 1B (2017)

Section

Computer Science

How to Cite

[1]
M. A. H. . Alrawi, I. T. . Ali, and O. A. . Saied, “Improved Weighted 0-1 Knapsack Method (WKM) to Optimize Resource Allocation ”, Iraqi Journal of Science, vol. 58, no. 1B, pp. 309–316, Jan. 2022, Accessed: Dec. 07, 2025. [Online]. Available: https://www.ijs.uobaghdad.edu.iq/index.php/eijs/article/view/6164

Similar Articles

1-10 of 935

You may also start an advanced similarity search for this article.