Results are now posted! They can be viewed here.
Last week, we were happy to see that this question about efficiently routing a UPS delivery was a challenge to the community. It inspired us to ramp up the problem and throw a quick mini competition to see who could find the shortest possible route for a worldwide delivery.
As part of a promotion to demonstrate their global service, UPS has decided to ship a single package around the world to hundreds of different cities. Help them plot a route that will minimize its travel distance. The journey must be a complete circuit; in other words, you must begin and end in the same location, and you must visit each city in the list.
Note: Make the simplifying assumption that the earth is a sphere with a radius of 6371 kilometers. There is a problem here about finding distances on a spherical earth, if you want a test case.
How Do I Enter The Competition?
This is a time limited competition, so submit your answer by 11:59 PM GMT on 1/26/2014 to this form.
The following are required for a complete submission:
- A link to your brilliant profile page.
- Your email address.
- The total distance of the journey (in km).
- A list of the cities’ index numbers, sorted in your optimal order.
- A copy of your code.
How Do I Win?
The person who submits original code that generates the shortest route linking all of the cities wins. Ties will be broken based on who submitted their answer first.
What are the Prizes?
Grand Prize: The winner will receive a brand new Android tablet, a winner’s certificate, a Brilliant.org t-shirt, and some secret awesomeness.
Honorable Mentions: The runner-up as well as other notable submissions (as judged by Brilliant staff) will receive certificates and Brilliant.org t-shirts.
Feel free to comment or ask questions below.