Tag Info

New answers tagged

0

Maybe you can start to have a look at Vespucci. It is an opensource OSM editor for Android devices who can display map tiles mainly from OSM based sources, but it should be possible to display any other non-tiled map imagery, I assume. And inside Vespucci you can display the current GPS position, but I am not aware whether this is using any google service ...


0

Pgrouting supports one way routing , see http://pgrouting.org/docs/howto/oneway.html Or you can use TRSP see: http://docs.pgrouting.org/dev/src/trsp/doc/index.html I think data has to have own line for each side of road to work


0

I don't think pgrouting has such functionality, but you can find it in our RW Net 4 library (www.routeware.dk)


1

It depends on what kind of result you expect to get. From your question, it may seem as VRP would be the best analysis type. You will define during the VRP analysis: each bus capacity (number of students it can take); what time of the day each bus can start driving and what time will they stop driving; maximum driving time for each bus (if you have any ...


1

I think you're on the right track, but my reading of your current problem could be solved - and I mean this in good spirits - by doing the pgRouting workshop: http://pgrouting.org/documentation.html -- see the workshop and tutorials part. The value here is you'll get a good sense of what you can do with your MapZen extract, how to use OSM2PGRouting, how to ...


1

Here is a list: Create a simple in-memory graph with nodes and edges. Apply A* to it (there are many examples on the web) Then look into the OSM data structure and build a simple parser (or reuse existing) to fill your in-memory graph then run A* on it via nodeIDs or lat/lon for start and end location create the address search which returns a nodeID or ...


1

Streets data are the most important part of your project. You have to get vector data with few requirements: it must be a complete network, without gaps and isolated streets each street beetween two nodes should be a single object, it should start and end in particular node, you can even split streets to straight lines (each single straight line is single ...


1

If you have to implement your own, then read here: http://en.wikipedia.org/wiki/A*_search_algorithm That way you learn the most. But if you start from scratch and want to implement ALL steps on your own, then it is a major task you are looking at.



Top 50 recent answers are included