Object Reward Weight A 20 1 B 5 10 D 40 8. 15 7 25 4 7 2 Maximum weight = 12 The above problem is a 0/1 Knapsack problem. You have to carry the different objects in your bag in a way such that the reward is maximized without exceeding the weight limit. You can carry an object exactly once but you always have to carry the object labelled “H". Assuming you are asked to use Genetic Algorithm for this problem, answer the following questions 1. Encode the problem and create an initial population of 4 different chromosomes 2. Explain what would be an appropriate fitness function for this problem. Use the fitness function and perform natural selection to choose the 2 fittest chromosomes. ' 3. Using the selected chromosomes perform a single point crossover to get 2 offspring 4. Perform mutation and check the fitness of the final offspring. Explain your work. 4.
Object Reward Weight A 20 1 B 5 10 D 40 8. 15 7 25 4 7 2 Maximum weight = 12 The above problem is a 0/1 Knapsack problem. You have to carry the different objects in your bag in a way such that the reward is maximized without exceeding the weight limit. You can carry an object exactly once but you always have to carry the object labelled “H". Assuming you are asked to use Genetic Algorithm for this problem, answer the following questions 1. Encode the problem and create an initial population of 4 different chromosomes 2. Explain what would be an appropriate fitness function for this problem. Use the fitness function and perform natural selection to choose the 2 fittest chromosomes. ' 3. Using the selected chromosomes perform a single point crossover to get 2 offspring 4. Perform mutation and check the fitness of the final offspring. Explain your work. 4.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
100%
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps with 5 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY