Traveling Salesman Problem is a well-known challenge which consists in finding the shortest route possible that goes through all cities only once. With 15 cities, that's 44 billion possibilities! A new approach using Self-Organizing Maps now solves it https://
diego.codes/post/som-tsp/

→ View original post on X — @pascal_bornet,