The traveling salesman problem solver

o You load distance matrix in excel format into the program.
Matrix can be as symmetric as asymmetric.
All distances must be non negative. Maximal size - 200x200.
You can download example of such matrix from https://shobb.github.io/smsl/DistanceMatrix.xlsx .
o Press button Start
o Program solves problem
o Results can be saved into Excel work book – with two sheets:
First sheet - one column with indices of points in best route.
Second sheet - more detailed information with distances between points.
o Program uses advanced genetic algorithm and gives very good solutions.
o You can increase parameters of algorithm especially it stopping criteria

• Number of generations without improvement if you want - it provides even
  more quality solutions at the price of time.