Comparison of Deterministic and Probabilistic Approaches for Solving 0/1 Knapsack Problem
The purpose of this paper is to analyze algorithm design paradigms applied to single problem – 0/1 Knapsack Problem. The Knapsack Problem is a combinatorial optimization problem where one has to maximize the benefits of objects in a knapsack without exceeding its capacity. It is an NP-complete problem and uses exact and heuristic techniques to get solved.
The objective is to analyze that how the various techniques like Dynamic Programming and Genetic Algorithm affect the performance of Knapsack Problem. Our experimental results show that the promising approach is genetic algorithm as it gives result in optimal time.
KeywordsKnapsack Problem NP-complete problem Dynamic Programming Genetic Algorithm
Unable to display preview. Download preview PDF.
- Cormen, T.H., Leiserson, C.E., Riverst, R.L., Stein, C.: Introduction to AlgorithmsGoogle Scholar
- Knapsack problem, http://www.utdallas.edu/~scniu/OPRE-6201/documents/DP3-Knapsack.pdf
- Poirriez, V., Yanev, N., Andonov, R.: A Hybrid Algorithm for the Unbounded Knapsack Problem (October 28, 2008)Google Scholar
- Dynamic programming, http://en.wikipedia.org/wiki/Dynamic_programming
- 0/1 knapsack problem, http://www.brpreiss.com/books/opus4/html/page445.html
- Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley (1990)Google Scholar
- Mitchell, M.: An Introduction to Genetic Algorithms. MIT PressGoogle Scholar
- Thesis by Shailendra Kumar, Choosing Best Algorithm Design Strategies For a Particular Problem (June 2009)Google Scholar