hw-optimization-design

• Course - Optimization Design：Theories and Applications to Sports Industry and Engineering 105-2
• Matlab

Final Project

Solving the Bounded Knapsack Problem with Genetic Algorithm

1. Run main.m

Capacity of the knapsack:20
Bounded constraint: for all item ≤3
Generation:50, Population:50
Crossover rate:0.5, Mutation rate:0.1

Demo

• Knapsack parameter setting from book Computer Algorithms, E. Horowitz, S. Sahni and S. Rajasekaran.
  

• The KP solution with 5 times.
  

• Convergence test of the GA to solve KP.
  

• The KP solution of GA with respect to different population.
  

• The KP solution of GA with respect to different mutation rate.