A bespoke python genetic algorithm to solve the generalised 2D travelling salesman problem. The code is mostly modular to allow for comparisons of GA parameters. Future additions will see implementation of additional selection and crossover processes.
HOW TO:
- Download and unzip files.
- Open TSP_run.py and modify the user inputs to suit your needs.
- Run TSP_run.py
- Review outputs.
User inputs:
- total_number_towns
- total_GA_population_size
- town_location_limit_lowerX
- town_location_limit_upperX
- town_location_limit_lowerY
- town_location_limit_upperY
- elitism_rate
- mutation_rate
- maximum_number_generations
- stagnation_criteria