Est. Budget: $60.00
You will implement a genetic algorithm to find solutions to the knapsack problem.
The general idea is based on the paper “Solving the 0-1 Knapsack Problem with Genetic Algorithms”
by Maya Hristakeva and Dipti Shrestha, which is available on MU Online. Your algorithm
will be a little easier than theirs. It will have these properties:
1. Roulette-wheel selection only (not group selection)
4. No use of elitism
5. Your code will run for a fixed number ...