CS $1181$ Project $1$: Genetic Algorithm

Background

Genetic algorithms are based on the concept of natural selection. They allow us to explore a

search space by $$evolving$$ a set of solutions to a problem that score well against a $=$itness

function. An example is particularly helpful in understanding this concept. We$$ll use the bin

packing problem, which is a famous problem in computer science. Pretend that your town

is being attacked by zombies, and you have to abandon your house and go on the run. $($It$$s

possible that this isn$$t $*$exactly$*$ how the problem is classically described, but this version is

way more interesting.$)$ You are only able to carry $10$ pounds of stuff with you in addition to

food and other necessities, and you want to bring things that you can sell for the greatest

amount of money possible. Below is a list of items you could take, along with their weight

and selling price. Which items should you take with you in order to maximize the amount of

money you can get?