Mapping the 2027 Tour de France with Clustering

À propos du projet

Machine Learnia Vacation Workbook: grouping 120 villages into 21 stages using unsupervised clustering (K-Means, hierarchical clustering), then computing the optimal route for each stage with a greedy heuristic and the 2-opt algorithm (a variant of the traveling salesman problem). The analysis revealed that the provided village list produced stages far longer than the Tour de France's real average (over 200 km versus roughly 150 km), a concrete dataset limitation identified and documented.

Stack technique