Edge based Graph Analysis - pgRouting/pgrouting GitHub Wiki

Here are some links that discuss modeling the edges as nodes in a graph. This is done for a variety of reasons like:

1. It is easier to model turn restrictions
2. it can reduce the number of node in the graph while increasing the number of edges and in general speeding up the time to compute a solution
3. it has some advantages for time dependent routing

Links

• https://algo2.iti.kit.edu/download/turn_ch.pdf

• http://lekv.de/pub/lv-turns-2008.pdf

• https://www.mapbox.com/blog/smart-directions-with-osrm-graph-model/

• http://algo2.iti.kit.edu/documents/Luxen%20Pub/sigproc-sp.pdf

• http://www.ijmo.org/vol5/480-T024.pdf

• http://www.thi.uni-hannover.de/fileadmin/forschung/arbeiten/nebesov-da.pdf

• http://www.routino.org/documentation/algorithm.html

• http://www.easts.info/on-line/journal_06/1426.pdf

• http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.8035&rep=rep1&type=pdf

• http://eprints.whiterose.ac.uk/74806/2/ATMOS09-timetable.pdf