TSP population based algorithms

Genetic algorithm for Travelling Salesman Problem

Input data is taken from a text file
Exemplary file could look like this (First number is the size of the matrix):

6
0 20 30 31 28 40
30 0 10 14 20 44
40 20 0 10 22 50
41 24 20 0 14 42
38 30 32 24 0 28
50 54 60 52 38 0

Program allows the user to change mutation and crossover probabilities, sizes of the population and elite, as well as genetic operators.

Implemented Genetic Operators

Kornel Błąkała

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
.gitignore		.gitignore
CrossoverOperator.cpp		CrossoverOperator.cpp
CrossoverOperator.h		CrossoverOperator.h
GeneticAlgorithm.cpp		GeneticAlgorithm.cpp
GeneticAlgorithm.h		GeneticAlgorithm.h
Individual.cpp		Individual.cpp
Individual.h		Individual.h
Matrix.cpp		Matrix.cpp
Matrix.h		Matrix.h
Mutator.cpp		Mutator.cpp
Mutator.h		Mutator.h
Population.cpp		Population.cpp
Population.h		Population.h
README.md		README.md
Selector.cpp		Selector.cpp
Selector.h		Selector.h
TSP_population_based_algorithms.cpp		TSP_population_based_algorithms.cpp
Timing.cpp		Timing.cpp
Timing.h		Timing.h
pch.cpp		pch.cpp
pch.h		pch.h