This is the simplest generic genetic algorithm for finding the sum optima. It was done as a part of assignment for the course of Evolutionary Computation.

About the algorithm

The goal was to maximize the sum of Xi, where i is a binary number taken from {0,1}; the sum is bounded by l, which is set in .h file. User also can specify the population size, number of generations, number of mutate points and the size of tournament (for tournament selection). The program was written in C, but using g++ (gcc) compiler for C++.