|RouteYou and the polytechnic school KAHO Sint-Lieven
Hogeschool have been working together for a long time. As
well for research purposes related to routing as for training of
students in engineering and computer science.
Time to time, we think of a practical problem we have and propose this to the students as an exercise.
And here we have another brain-squeezer!
You like to join the game? Let us know and send your solution for the problem below!
|The problem||Some of the routes created on RouteYou are try-outs of the users, and gave not a great quality. Keeping them in the system is just annoying for all the others searching for useful routes.|
|The challenge||Develop an algorithm which detects if a route is GOOD or BAD. Of course, you can also make gradations of GOOD and BAD. Although there are many variables we could provide you te define a 'GOOD' vs a 'BAD' route, this algorithm should only work with the sequence of x,y-coordinates as input, representing the track of the route. Nothing else!|
|The data||We provide you with data, listed below where we defined
two groups: a list of routes which are GOOD and a list of routes which
are BAD. You can get to the actual data when you click on the route and
click on download. You will find a GPX file, containing the track of
the route. This should be the input for the solution.
Here you find more info about the XML format GPX.
|A list of 'bad routes'||A list of 'good routes'|
Let us know about your results and send it to