Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25382
Title: A hybrid link-node approach for finding shortest paths in road networks with turn restrictions
Authors: Li, Q
Chen, BY
Wang, Y
Lam, WHK 
Issue Date: 2015
Publisher: Blackwell Publishing Ltd
Source: Transactions in GIS, 2015 How to cite?
Journal: Transactions in GIS 
Abstract: Turn restrictions, such as 'no left turn' or 'no U-turn', are commonly encountered in real road networks. These turn restrictions must be explicitly considered in the shortest path problem and ignoring them may lead to infeasible paths. In the present study, a hybrid link-node Dijkstra's (HLND) algorithm is proposed to exactly solve the shortest path problem in road networks with turn restrictions. A new hybrid link-node labelling approach is devised by using a link-based labelling strategy at restricted nodes with turn restrictions, and a node-based labelling strategy at unrestricted nodes without turn restrictions. Computational results for several real road networks show that the proposed HLND algorithm obtains the same optimal results as the link-based Dijkstra's algorithm, while having a similar computational performance to the classical node-based Dijkstra's algorithm.
URI: http://hdl.handle.net/10397/25382
ISSN: 1361-1682
DOI: 10.1111/tgis.12133
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

9
Last Week
0
Last month
0
Citations as of Sep 15, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Sep 24, 2017

Page view(s)

48
Last Week
4
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.