An attempt to optimize Travelling Salesman Problem using Genetic Algorithm.
Steps:
- Generate an initial population of random paths.
- Use Tournament Selection to pick parents.
- Apply Ordered Crossover for offspring generation.
- Implement Mutation (random swaps) to maintain diversity.
- Uses 2-opt optimization for local path improvement.
- Adjust the mutation rate dynamically over generations. (change the mutation rate by trial and error depending on the input size)