Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem
-
Upload
international-islamic-university -
Category
Education
-
view
431 -
download
0
Transcript of Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem
![Page 1: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/1.jpg)
Presented By Sunawar Khan
Mehwish Shabbir
Presented To:Dr. Ayaz Hussain
1
![Page 2: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/2.jpg)
Paper Title
GENETIC ALGORITHM BASED APPROACH TO SOLVE NON-FRACTIONAL (0/1) KNAPSACK OPTIMIZATION PROBLEM. Author Name
Vikas Thada, Shivali Dhaka, Amity University, Gurgaon, India YEAR OF PUBLISH
2014. JOURNAL
International Journal of Computer Applications (0975 – 8887) - Volume 100 – No.15, August 2014.
2
![Page 3: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/3.jpg)
Solve the non-fractional knapsack problem also known as 0-1 knapsack using genetic algorithm.
Keywords: Genetic algorithm, Knapsack, Optimization.
The other approaches for solving are greedy method and dynamic programming. The greedy approach does not always results in an optimal solution and dynamic programming method having time complexity of O(nW) where n is number of items and W is the capacity of the knapsack..
3
![Page 4: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/4.jpg)
Problem: Given, number of items each with a weight and value. The aim is to find each item to be put in a knapsack so that the total weight of included items is less than or equal to the capacity of the knapsack simultaneous total value of the included items should be maximum. It’s a problem that belongs to the NP class of problems. The decision problem form of the knapsack problem is NP-complete whereas optimization problem is NP-hard..
Hypothesis: The GA based methods takes very less time and returns results in an efficient manner as compare to Greedy and DP methods.
4
![Page 5: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/5.jpg)
GENETIC ALGORITHMFitness EvaluationSelectionCrossoverMutation
5
![Page 6: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/6.jpg)
Knapsack problem with knapsack and four items
15-6
![Page 7: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/7.jpg)
Item (xi) Profit (pi) Weight (wi)1 25 32 20 23 15 14 40 45 50 5
15-7
Total possible solutions 25=32
![Page 8: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/8.jpg)
15-8
![Page 9: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/9.jpg)
MATLAB IMPLEMENTATION of 0-1 Knapsack Problem by GA.
Fitness FunctionConstraint FunctionCreation Function
9
![Page 10: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/10.jpg)
Conclusion: GA method is more efficient and less time consuming than Greedy and DP methods even with large dataset.
10
![Page 11: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/11.jpg)
Remainder Selection Operator Uniform Selection Operator Roulette Selection Operator Stochastic Selection Operator
Results: The GA based methods takes very less time and returns results in an efficient manner as compare to Greedy and DP methods.
15-11
![Page 12: Genetic Algorithm based Approach to solve Non-Fractional (0/1) Knapsack Optimization Problem](https://reader031.fdocuments.us/reader031/viewer/2022021920/58e536561a28abac7e8b636d/html5/thumbnails/12.jpg)
12