#35 — Traveling Salesperson
- 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 ...
Origin an more details about the TSP problem.
An algorithm for lexicographic ordering explained by Michal Forišek.
Documentation on JavaScript Arrays.
Documentation on the includes() method of JavaScript Arrays.
Documentation on the reverse() method of JavaScript Arrays.
Documentation on ES6 Set objects in JavaScript.
Syllabus for Part 2 of The Nature of Code: "Intelligence and Learning" at ITP Spring 2017.
The Nature of Code book.
How to pick an item randomly from an array with a non-uniform distribution.
A Coding Train YouTube playlist about Genetic Algorithms.
Livestream with Traveling Salesperson.
Livestream with Traveling Sales Person with Genetic Algorithm
- Editing
by Mathieu Blanchette
- Animations
by Jason Heglund