The binary knapsack problem

The goal of this assignment is for you to become familiarized with implementing GAs and conducting scientific experiments involving EAs. The problem that you will be solving is the classic Binary Knapsack problem. The deliverables of this assignment are your GA implementation and accompanying report in PDF or Word format. The EA design approach that you are to follow is described in [Eiben2003], pp. 27-29. This is an individual assignment. You may use the programming language of your choice (note, however, that your instructor will only provide implementation assistance for C++). Your report will be held against the same standard as a journal article (except for the lack of the novelty requirement), so it should be written and typeset in a professional manner (LTEX is recommended). On Thursday 7 October 2004 you will give an about 15 minute demo of your implementation for the first part of your grade. The deadline for submitting via Blackboard’s Digital Drop Box your report and final implementation is Thursday 14 October 2004.