File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/11758501_129
- Scopus: eid_2-s2.0-33746622820
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A shortest path searching method with area limitation heuristics
Title | A shortest path searching method with area limitation heuristics |
---|---|
Authors | |
Issue Date | 2006 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 6th International Conference on Computational Science (ICCS 2006), Reading, UK., 28-31 May 2006. In
Lecture Notes In Computer Science, 2006, v. 3991, p. 884-887 How to Cite? |
Abstract | While heuristics based on geometric constructs of the networks would appear to improve performance of Dijkstra's algorithm, the fallacy of depreciated accuracy has been an obstacle to the wider application of heuristics in the search for shortest paths. The authors presented a shortest path algorithm that employs limited area heuristics guided by spatial arrangement of networks. The algorithm was shown to outperform other theoretically optimal solutions to the shortest path problem and with only little accuracy lost. More importantly, the confidence and accuracy levels were both controllable and predictable. © Springer-Verlag Berlin Heidelberg 2006. |
Persistent Identifier | http://hdl.handle.net/10722/159112 |
ISSN | 2020 SCImago Journal Rankings: 0.249 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lu, F | en_US |
dc.contributor.author | Lai, PC | en_US |
dc.date.accessioned | 2012-08-08T09:08:04Z | - |
dc.date.available | 2012-08-08T09:08:04Z | - |
dc.date.issued | 2006 | en_US |
dc.identifier.citation | The 6th International Conference on Computational Science (ICCS 2006), Reading, UK., 28-31 May 2006. In Lecture Notes In Computer Science, 2006, v. 3991, p. 884-887 | en_US |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/159112 | - |
dc.description.abstract | While heuristics based on geometric constructs of the networks would appear to improve performance of Dijkstra's algorithm, the fallacy of depreciated accuracy has been an obstacle to the wider application of heuristics in the search for shortest paths. The authors presented a shortest path algorithm that employs limited area heuristics guided by spatial arrangement of networks. The algorithm was shown to outperform other theoretically optimal solutions to the shortest path problem and with only little accuracy lost. More importantly, the confidence and accuracy levels were both controllable and predictable. © Springer-Verlag Berlin Heidelberg 2006. | en_US |
dc.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
dc.title | A shortest path searching method with area limitation heuristics | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Lai, PC:pclai@hkucc.hku.hk | en_US |
dc.identifier.authority | Lai, PC=rp00565 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1007/11758501_129 | en_US |
dc.identifier.scopus | eid_2-s2.0-33746622820 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33746622820&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 3991 | en_US |
dc.identifier.spage | 884 | en_US |
dc.identifier.epage | 887 | en_US |
dc.publisher.place | Germany | en_US |
dc.identifier.scopusauthorid | Lu, F=9040432300 | en_US |
dc.identifier.scopusauthorid | Lai, PC=7202946446 | en_US |
dc.customcontrol.immutable | sml 160224 - amend | - |
dc.identifier.issnl | 0302-9743 | - |