A traveller has to pass in every city of Qatar in the most short distance.
The main goal of this evolutionary algorithm is to find the shortest possible route that visits each city and returns to the origin city in Qatar (the traditional Travelling Salesman problem). Check out more in http://www.math.uwaterloo.ca/tsp/world/countries.html.
The Indiv class represents the individuals whose genes correspond to a given path. Their fitnesses are calculated by the total travelled distance.
The Popul class represents the population which is composed by individuals.
The EvolAlgorithm represents the evolutionary algorithm.