[OSM-talk] Oxbridges of Konigsberg

2009-02-12 Thread Stephen Gower
A friend asks:

 What's the most efficient route for visiting all Oxford's
 colleges?
 
 Method of transport: bicycle. No other restrictions except that
 you must pass the lodge of each college. Doubling back on
 yourself is allowed (despite the title of the post!).

So, since the data for Oxford is pretty much there, is this a
challenge any of the routing engines can help with?

s

___
talk mailing list
talk@openstreetmap.org
http://lists.openstreetmap.org/listinfo/talk


Re: [OSM-talk] Oxbridges of Konigsberg

2009-02-12 Thread Andrew Chadwick (email lists)
Stephen Gower wrote:
 What's the most efficient route for visiting all Oxford's
 colleges?

 Method of transport: bicycle. No other restrictions except that
 you must pass the lodge of each college. Doubling back on
 yourself is allowed (despite the title of the post!).
 
 So, since the data for Oxford is pretty much there, is this a
 challenge any of the routing engines can help with?

Not purely based on OSM data, you'll need OXPOINTS information for the
lodge locations too. Bicycle restrictions are probably pretty good by
now, for the most part.

Annoyingly for puns, it's not a Hamiltonian cycle either. Travelling
Salesman^WStudent Problem, maybe. How to weight the graph? Cobbles,
distance, proximity of pubs?

-- 
Andrew Chadwick

___
talk mailing list
talk@openstreetmap.org
http://lists.openstreetmap.org/listinfo/talk


Re: [OSM-talk] Oxbridges of Konigsberg

2009-02-12 Thread Stephen Gower
On Thu, Feb 12, 2009 at 10:47:10AM +, Andrew Chadwick (email lists) wrote:
 Stephen Gower wrote:
  What's the most efficient route for visiting all Oxford's
  colleges?
  
  So, since the data for Oxford is pretty much there, is this a
  challenge any of the routing engines can help with?
 
 Not purely based on OSM data, you'll need OXPOINTS information for the
 lodge locations too.

Given who the friend is, I suspect the reason for asking is that they want
to improve the OXPOINTS data, which, if this is the case will also have the
advantage that it won't have been derived from GoogleMaps like the current
dataset is.

But, can it be done?

s

___
talk mailing list
talk@openstreetmap.org
http://lists.openstreetmap.org/listinfo/talk


Re: [OSM-talk] Oxbridges of Konigsberg

2009-02-12 Thread Robert Vollmert

On Feb 12, 2009, at 12:06, Stephen Gower wrote:

 On Thu, Feb 12, 2009 at 10:47:10AM +, Andrew Chadwick (email  
 lists) wrote:
 Stephen Gower wrote:
 What's the most efficient route for visiting all Oxford's
 colleges?

 So, since the data for Oxford is pretty much there, is this a
 challenge any of the routing engines can help with?

 Not purely based on OSM data, you'll need OXPOINTS information for  
 the
 lodge locations too.

 Given who the friend is, I suspect the reason for asking is that  
 they want
 to improve the OXPOINTS data, which, if this is the case will also  
 have the
 advantage that it won't have been derived from GoogleMaps like the  
 current
 dataset is.

 But, can it be done?

I'm not sure this is documented or encouraged, thus I'm not sure the  
URL will stay accessible, but

$ curl -d  
'Start 
= 
-1.267,51.75034 
End 
= 
-1.260884,51.753598 
Via 
= 
lang 
= 
de 
distunit 
= 
KM 
routepref=BicycleavoidAreas=useTMC=noMotorways=instructions=true' 
http://data.giub.uni-bonn.de/openrouteservice/php/OpenLSRS_DetermineRoute.php 
  | grep TotalTime

yields the time that ORS calculates for the bicycle route from Start  
to End.

Do this for each pair of college locations, and you've got yourself a  
complete graph you can solve traveling salesman for.

Cheers
Robert


___
talk mailing list
talk@openstreetmap.org
http://lists.openstreetmap.org/listinfo/talk