Fastest Round-Trip Solver
January 31, 2008 | By Raymond T. Hightower
An online application called OptiMap will take a list of addresses and calculate the shortest round trip that covers all of the locations. Minimize time, maximize productivity.
Traveling Salesman Problem
It’s an old problem in mathematics. A traveling salesman needs to visit five customers in five locations. He doesn’t get paid to be on the road. He gets paid to see customers. Travel time doesn’t generate income. Backtracking is wasted time.
So the key thing is to minimize time on the road.
OptiMap seeks to solve this age-old problem using mathematics online. If you need to visit multiple locations in your daily work, try it out!