Performance Improvement with Hashing to Solve 0-1 Knapsack Problem using Genetic Algorithm

摘要

Genetic algorithm is use to solve the 0-1 knapsack problem (KP). The genetic algorithm on which this work is based on uses hashing function to store every feasible solution into the hash table. The 0-1 knapsack problem is an example of a combinatorial optimization problem, which seeks to maximize the benefit of objects in a knapsack without exceeding its capacity. Genetic algorithm is computer algorithm that search for good solution to a problem from among the large number of possible solutions.