Problem Statement
Implement Genetic Algorithm in Python to solve Traveling Salesman Problem
TSP Description 8 cities in all Cost from A to B would be same for B to A
GA Description • Population Size – 10 • Fitness Function – Cost of the tour • Parent Selection Scheme – Binary Tournament • Crossover operator – 2 points cross over – randomly selected points • Mutation operator – Swap Mutation – randomly selected points • Pool of offspring – 10 • Survival Mechanism – Truncation • Termination Condition – 100 Generations