- Part 1 - Traveling Salesperson (TSP)Trying all possible paths randomly.
- Part 2 - Lexicographic OrderGenerating permutations in Lexicographic Order.
- Part 3 - TSP with Lexicographic OrderApplying Lexicographic Order to solve the TSP problem.
- Part 4 - TSP with Genetic AlgorithmUsing a Genetic Algorithm to solve the TSP problem.
- Part 5 - TSP with Genetic Algorithm and CrossoverApplying Crossover to improve the Genetic Algorithm.
In Part 1 of this multi-part coding challenge, I introduce the classic computer science problem of the Traveling Salesperson (TSP) and discuss the pitfalls with a brute force solution. In Part 2, I discuss Lexicographic Ordering and demonstrate one algorithm to iterate over all ...
by Mathieu Blanchette
by Jason Heglund