Jason Cole • 1/15/2017

The Optimal London Pub Crawl

This article applies the traveling salesman problem (TSP) algorithm to plan an efficient London pub crawl. The author selects 8 pubs from a list of 22, uses Google Directions API to build a travel time matrix, and computes the optimal route. It combines programming, algorithms, and API usage in a fun tech-focused project, demonstrating how TSP can solve real-world routing problems.

0 comments

#algorithms #Route Optimization #Travelling Salesman Problem