File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A shortest path searching method with area limitation heuristics

TitleA shortest path searching method with area limitation heuristics
Authors
Issue Date2006
PublisherSpringer 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?
AbstractWhile 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 Identifierhttp://hdl.handle.net/10722/159112
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorLu, Fen_US
dc.contributor.authorLai, PCen_US
dc.date.accessioned2012-08-08T09:08:04Z-
dc.date.available2012-08-08T09:08:04Z-
dc.date.issued2006en_US
dc.identifier.citationThe 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-887en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/159112-
dc.description.abstractWhile 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.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes in Computer Scienceen_US
dc.titleA shortest path searching method with area limitation heuristicsen_US
dc.typeConference_Paperen_US
dc.identifier.emailLai, PC:pclai@hkucc.hku.hken_US
dc.identifier.authorityLai, PC=rp00565en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1007/11758501_129en_US
dc.identifier.scopuseid_2-s2.0-33746622820en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33746622820&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume3991en_US
dc.identifier.spage884en_US
dc.identifier.epage887en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridLu, F=9040432300en_US
dc.identifier.scopusauthoridLai, PC=7202946446en_US
dc.customcontrol.immutablesml 160224 - amend-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats