This document discusses genetic algorithms and provides an example of using them to solve a knapsack problem. It describes 4 combinations of items (C1-C4) along with their values and weights and whether they were accepted into the knapsack. A function is also defined to calculate the value of each combination as a percentage of the total possible value. Links to YouTube videos about genetic algorithms are included at the end.

1. Genetic Algorithms
Hup University
25-08-2018

6. x1
x2
x3
x4

10. ABDBD
ABCD

11. knapsack
item
value of
Knapsack
Weight of
knapsack
C1 (BC) 15 10 Accepted
C2 (BD) 12 5 Accepted
C3 (ABD) 15 10 Accepted
C4 (ABCD) 34 17 Not Accepted
knapsack
item
F( )
C1 (BC) 15/42=0.357 36%
C2 (BD) 12/42=0.285 28%
C3 (ABD) 15/42=0.357 36%
F( )=value of knapsack/sum of =value of knapsack
1
2
3

12. 1
2
3

15. • https://www.youtube.com/watch?v=JgqBM7J
G9ew
• https://www.youtube.com/watch?v=FQsjFCfm
0Ao