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

Section

Computer Science

How to Cite

Improved Weighted 0-1 Knapsack Method (WKM) to Optimize Resource Allocation . (2022). Iraqi Journal of Science, 58(1B), 309-316. https://ijs.uobaghdad.edu.iq/index.php/eijs/article/view/6164

Similar Articles

41-50 of 837

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