This week's challenge can have many ways to do it. However, the purpose is to explore Graph theory. Give it a shot to see what you can do.
You run a post office and you have a certain number of destinations that you need to deliver to. However, each one has a certain cost associated with it. For example, if stop A and stop B are close by, it is better to go by A, then B rather than going to A, back to the post office and then to B. See if you can find the optimal route for a list of several delivery locations.
For a tougher challenge, create a list of destinations on a route not just for one truck, but optimize the algorithm to handle any number of trucks and find the fastest/most efficient route for a bunch of delivery trucks.
Page 1 of 1
2 Replies - 6925 Views - Last Post: 24 January 2011 - 02:46 PM
Replies To: [Competition] Function Challenge #3
Re: [Competition] Function Challenge #3
Posted 24 January 2011 - 02:46 PM
This is the first challenge I'm posting to, so I don't really know the protocol...so the description's going in spoiler tags and my JAR (including the ugly, mostly uncommented source) is here: FunctionChallenge3.jar.
Page 1 of 1