Previously, I invited you to check out the Bing Maps Trip Optimizer sample, which I wrote. Bing Maps Trip Optimizer computes the shortest route among a set of locations. (This classic computing problem is also known as the traveling salesman problem.) The traveling salesman problem is traditionally solved by using a brute-force technique: compute each possible route among all locations and choose the shortest. This problem becomes exponentially more difficult as you increase the number of locations. Because a brute-force approach might not solve larger problems in a reasonable time, Bing Maps Trip Optimizer uses a technique known as ant colony optimization to more quickly and efficiently approximate the shortest route.
The version that runs as a Metro style app demonstrates many of the new features that are part of the Parallel Patterns Library, for example:
The sample also explains how we migrated the existing app for use as a Metro style app.
Also, don’t forget to grab a Bing Maps Key to run the sample.
We’d love to hear your feedback, both on the sample code and on your experience with the documentation. If you rate the documentation on the Windows Dev Center, please take an extra moment to tell us how you liked the content, and how we can improve it.