Skip to content

Latest commit

 

History

History
24 lines (16 loc) · 864 Bytes

README.MD

File metadata and controls

24 lines (16 loc) · 864 Bytes

Traveling Salesman problem with Genetic Algorithms

To understand the Mutation and Crossover functions, please refer to this link.

Random locations

random-locations-gif random-locations-png

Circular locations

circular-locations-gif circular-locations-png

Two circles locations

This problem is usually a bit harder to optimize. two circular gif two circular dist

Technical details

I added the 1-circle and 2-circle locations because it's known which way is the optimal one.

Note: The distance graph doesn't track duplicant points.

Note: This project uses C# and Python3.