Pokemon Go and the Traveling Salesman Problem

These days you may have heard stories of people hunting down Pokémon on their office desks, in hospital rooms, and even in bathrooms. Read about the brilliant mechanics of Pokémon Go. Do you want to catch them all? As quickly as possible? There is a math model for that called the Traveling Salesman Problem (TSP). There are many good TSP solvers that may check every possible route to pick out the shortest one. Read more

This entry was posted in Case Studies, Optimization, Trends. Bookmark the permalink.

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s