Fortran implementation solving the travelling salesman problem based on a genetic algorithm.
Implementation allows for parallel optimization over multiple gene pools. To speed up convergence 2-opt optimization is included to resolve intersections of path segments.