Loading...
Please wait, while we are loading the content...
Genetic Algorithm based Approach to Solve Non Fractional (0/1) Knapsack Optimization Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Thada, Vikas Dhaka, Shivali |
| Copyright Year | 2014 |
| Abstract | this paper we solve the non fractional knapsack problem also known as 0-1 knapsack using genetic algorithm. The usual approaches are greedy method and dynamic programming. Its an optimization problem where we try to maximize the values that can be put into a knapsack under the constraint of its weight. We solve the problem using genetic algorithm in matlab using gatool. In this research work different selection schemes have been used like roulette wheel, tournament selection, Stochastic selection etc. Following the introduction of genetic algorithm and knapsack problem, formulation of 0-1 knapsack problem in genetic algorithm is presented. Experimental results using various selection schemes have been analyzed and comparison of genetic algorithm technique is done with greedy method and dynamic programming optimizing techniques. |
| Starting Page | 21 |
| Ending Page | 26 |
| Page Count | 6 |
| File Format | PDF HTM / HTML |
| DOI | 10.5120/17601-8200 |
| Volume Number | 100 |
| Alternate Webpage(s) | http://www.jiaats.com/Journals-Pdf/April-2015/jase/Jase-5.pdf |
| Alternate Webpage(s) | http://research.ijcaonline.org/volume100/number15/pxc3898200.pdf |
| Alternate Webpage(s) | https://doi.org/10.5120/17601-8200 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
