Skip to main content
Article thumbnail
Location of Repository

A complementary heuristic for the unbounded knapsack problem

By Swarna Chitra Iyer


As a solution algorithm for Unbounded Knapsack Problem, the\ud performance analysis of density-ordered greedy heuristic, weight-ordered\ud greedy heuristic, value-ordered greedy heuristic, extended greedy\ud heuristic and total-value heuristic has been done. Empirical experiments\ud on different test problems have been analysed and reported. Problem\ud instances with a very large number of undominated items were generated\ud in addition to the types of instances suggested by Martello and Toth\ud (1990). Theoretically, the lower bound on the performance for total-value\ud heuristic is better than the corresponding lower bounds for the densityordered\ud greedy heuristic and the extended greedy heuristic as discussed\ud by White (1992) and Kohli and Krishnamurti (1992). The computational\ud tests fail to show clear superiority of any particular heuristic algorithm,\ud although each heuristic produces good quality solutions. If the\ud combination of the density-ordered greedy and the total-value greedy\ud heuristics are considered then the combination shows complementary\ud effect. A new heuristic algorithm incorporating the structural properties of\ud the density-ordered greedy heuristic and the total-value greedy heuristic\ud is developed and its complementary effect studied. It was found that the\ud combination of the density-ordered greedy heuristic, the extended greedy\ud heuristic, the total-value greedy heuristic and the new complementary\ud heuristic gives a better performance result than the single best heuristic in\ud the combination

Topics: 0102 Applied Mathematics, 0103 Numerical and Computational Mathematics, School of Engineering and Science, applied mathematics, heuristic programming, NP-complete problems
Year: 1997
OAI identifier:

Suggested articles


  1. (1975). Merging and Sorting Applied to the Zero-One Knapsack Problem,
  2. (1996). Optimal Access Control for Broadband Services: Stochastic Knapsack with Advance Information,
  3. (1974). Computing Partitions with Applications to the Knapsack Problem,
  4. (1975). Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems,
  5. (1994). Some Complexity Issues in a Class of Knapsack Problems: What Makes a Knapsack Problem "Hard"?,
  6. (1996). A Strategy for Evolution of Algorithms to Increase the Computational Effectiveness of NP-hard Scheduling Problems,
  7. (1977). Branch and Bound Algorithms for the Solution of the General Unidimensional Knapsack Problem,
  8. (1984). A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem,
  9. (1995). Avoiding Anomalies in the MT2 Algorithm by Martello and Toth,
  10. (1995). An Expanding-core Algorithm for the Exact 0-1 Knapsack Problem,
  11. (1978). A Direct Descent Binary Knapsack Algorithm,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.