Skip to content

Latest commit

 

History

History
7 lines (5 loc) · 298 Bytes

File metadata and controls

7 lines (5 loc) · 298 Bytes

This project applies a genetic algorithm to solve the knapsack problem for a given weight and value of items.

🧬 Genetic Representation

  • Chromosome: A binary list indicating which items are selected.

🧮 Fitness Function

  • Maximizes total value while staying under the weight limit.