Skip to content

Latest commit

 

History

History
8 lines (6 loc) · 460 Bytes

README.md

File metadata and controls

8 lines (6 loc) · 460 Bytes

The-traveling-Salesman-Problem

Program proposing a solution to the traveler's problem Program proposing a solution to the traveler's problem

The core of the algorithm is "Evolutionary Strategies", that algorithm was used as the main since we use a selection of individuals in a helithist way, at no time we let bad individuals pass.

The way data is taken is within a 20x20 matrix, and fitness to get the enhancements lies in the distance of these points.