Dynamic Penalty Methods

ConstraintHandlingPoints 100, Due: April 11Note: Different tasks for the undergraduate and graduate sectionsIn this project you will implement a binary-coded (bit-string) GA to solve the 0-1 knapsackproblem of size 20. Create (possibly randomly, within some bounds) your own weights wi’s,values vi’s and knapsack capacity W (being able to create meaningful problem instances is animportant learning activity), where i runs from 1 to 20. (Study the discussion in Section 4.5 ofMichalewicz on the difficulty levels of different types of knapsack problems.) Implementproportional, stochastic binary tournament, and linear ranking selection in the same program(allow the user to choose one of these three).• The undergrad section will implement one of the static penalty approaches.• The grad section will do both: (one) static and (one) dynamic penalty methods.Explain in the report the penalty methods you used. Include in your results two extreme cases(the one where no single item can be fit in the knapsack and the one where the problem istrivially solved, i.e., the knapsack can hold all the items), in addition to one “regular” case. [Thismeans a total of three problem instances will need to be created and solved.]The output should include the problem statement (weights, values, capacity of the probleminstance) and averages over 10 independent runs of the best-of-run solutions on each of thethree instances. Submission and group instructions are as before.

RECOMMENDED: [SOLVED] Dynamic Penalty Methods