Welcome to the National Transport Library Catalogue

Normal view MARC view

Road Network Representation using Dijkstra's Shortest Path Algorithm Wang, Yubin ; Vrancken, J ; Soares, Michel dos Santos

By: Contributor(s): Publication details: Bryssel ITS in daily life: 16th world congress and exhibition on intelligent transport systems and services, Stockholm 21-25 September 2009. Paper, 2009Description: 5 sSubject(s): Bibl.nr: VTI P1835:16 [World]Location: Abstract: In this paper the authors present a new approach to road network representation for the purpose of monitoring and controlling traffic. The new approach is based on so-called mainlinks and accessorlinks instead of the usual links and nodes. The accessorlinks express the complexity of the connection to an intersection of the end of a link (mainly the get-in-lane segments). To detect junctions and accessorlinks automatically for urban road networks from a detailed road network database, a simple distance based algorithm is sufficient. However, motorway junctions are larger and more complex. In this case, Dijkstra's shortest path algorithm is useful to detect accessorlinks automatically. The representation is used in traffic control systems at the Dutch traffic management company Trinit‚´e Automatisering B.V.
Item type: Reports, conferences, monographs
Holdings
Current library Status
Statens väg- och transportforskningsinstitut Available

In this paper the authors present a new approach to road network representation for the purpose of monitoring and controlling traffic. The new approach is based on so-called mainlinks and accessorlinks instead of the usual links and nodes. The accessorlinks express the complexity of the connection to an intersection of the end of a link (mainly the get-in-lane segments). To detect junctions and accessorlinks automatically for urban road networks from a detailed road network database, a simple distance based algorithm is sufficient. However, motorway junctions are larger and more complex. In this case, Dijkstra's shortest path algorithm is useful to detect accessorlinks automatically. The representation is used in traffic control systems at the Dutch traffic management company Trinit‚´e Automatisering B.V.