Maximum weight = 20 The above problem is a 0/1 Knapsack problem. Here there are 7 different objects labelled from A to G. The objective of this problem is to carry the different objects in your bag in such a way such that the profit is maximized. But you have to make sure that your bag does not exceed the maximum weight i.e. the maximum weight that this bag can carry is less than or equal to 15. Remember you can carry an object exactly once. Now it is your job to use Genetic Algorithm to solve this problem.
1. Encode the problem and create an initial population of 4 different chromosomes
2. Think of an appropriate fitness function to this problem and give proper justification.
3. Use the fitness function to calculate the fitness level of all the chromosomes in your population
4. Perform natural selection and select the two fittest chromosomes
5. Use the parents from (4) and perform crossover to get 2 offspring
6. Perform mutation and check the fitness of the final offspring. Comment whether you have
Transcribed Image Text:Object
Profit
Weight
A
7
3
B
12
6.
5
E
4
5
F
16
1
G
20
4
Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
