How does tournament size impact outputs of knapsack problem solving algorithms? The sizes we are looking at are 2 and 8.
We are running on Rust (DEAP)
We are going to run two small capacity knapsacks and two large The specific ones are:
They are generated from this code.
We will perform 30 runs for each knapsack and each tournament size. This will be 240 runs total. (30 runs x 4 knapsacks x 2 sizes)
We plan to collect the best overall legal value and best legal final value.
We will collect it in a google spreadsheet.
We will share our information as a google spreadsheet.
We will run this Tuesday night(2/4/25) in the secondary computer science lab on four computers. Both of us will be there running 2 computers each. Josie will step out for a meeting at some point.
Use % cargo run --release and % cargo build --release to reduce run time. Run out of target/release/--- directory.