Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 226 Bytes

File metadata and controls

2 lines (2 loc) · 226 Bytes

Parallel-Genetic-Algorithm-to-optimize-TSP

This project uses the concepts of evolutionary biology like Darwin's survival of the fittest, crossover and mutation to find the least cost path in the Travelling Salesman Problem.