Category Archives: Programming

Behind the Scenes of OptiMap

What really happens when you hit the ‘Calculate fastest roundtrip’-button in OptiMap? The problem we attempt to solve is a classic and is called the ‘Travelling Salesman Problem’ or simply TSP. Before we dive into this intrigueing question, some definitions are useful. Each location will be referred to as a node, with location number denoted… Continue reading »

A Fastest Roundtrip Finder for Google Maps

Imagine you are a salesperson and have to visit a number of customers. However, you want to spend as little time as possible driving. If you only have to visit two or three locations, it is usually easy to find the optimal route. You can use regular map services such as Google Maps, Yahoo! Maps or MapQuest to find the shortest path between two places. However, as the number of… Continue reading »