Engineering Highway Hierarchies工程等级分路

Engineering Highway Hierarchies工程等级分路

ID:39065669

大小:426.03 KB

页数:38页

时间:2019-06-24

Engineering Highway Hierarchies工程等级分路_第1页
Engineering Highway Hierarchies工程等级分路_第2页
Engineering Highway Hierarchies工程等级分路_第3页
Engineering Highway Hierarchies工程等级分路_第4页
Engineering Highway Hierarchies工程等级分路_第5页
资源描述:

《Engineering Highway Hierarchies工程等级分路》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、EngineeringHighwayHierarchiesPeterSandersandDominikSchultesUniversit¨atKarlsruhe(TH),76128Karlsruhe,Germany,{sanders,schultes}@ira.uka.deAbstract.Highwayhierarchiesexploithierarchicalpropertiesinherentinreal-worldroadnetworkstoallowfastandexactpoint-to-pointshortest-pathqueries.Afastpreprocessi

2、ngroutineiterativelyperformstwosteps:first,itremovesedgesthatonlyappearonshortestpathsclosetosourceortarget;second,itidentifieslow-degreenodesandbypassesthembyintroducingshortcutedges.TheresultinghierarchyofhighwaynetworksisthenusedinaDijkstra-likebidirectionalqueryalgorithmtoconsiderablyreduceth

3、esearchspacesizewithoutlosingexactness.Thecrucialfactisthat`faraway'fromsourceandtargetitissufficienttoconsideronlyhigh-leveledges.Variousexperimentswithreal-worldroadnetworksconfirmtheperformanceofourapproach.Ona2.0GHzmachine,preprocessingthenetworkofWesternEurope,whichconsistsofabout18millionno

4、des,takes13minutesandyields48bytesofadditionaldatapernode.Then,randomqueriestake0.61msonaverage.Ifwearewillingtoacceptslowerquerytimes(1.10ms),thememoryusagecanbedecreasedto17bytespernode.Wecanguaranteethatatmost0.014%ofallnodesarevisitedduringanyquery.ResultsforUSroadnetworksaresimilar.Highway

5、hierarchiescanbecombinedwithgoal-directedsearch,theycanbeextendedtoanswermany-to-manyqueries,andtheyareacrucialingredientforotherspeeduptechniques,namelyfortransit-noderoutingandhighway-noderouting.1IntroductionComputingfastestroutesinroadnetworksfromagivensourcetoagiventargetlocationisoneofthe

6、showpiecesofreal-worldapplicationsofalgorithmics.Manypeoplefrequentlyusethisfunctionalitywhenplanningtripswiththeircars.Therearealsomanyapplicationslikelogisticplanningortrafficsimulationthatneedtosolveahugenumberofshortest-pathqueries.InprinciplewecoulduseDijkstra'salgorithm[1].Butforlargeroadn

7、etworksthiswouldbefartooslow.Therefore,thereisconsiderableinterestinspeeduptechniquesforrouteplanning.Mostapproaches,includingours,assumethattheroadnetworkisstatic,i.e.,itdoesnotchangeveryoften.Then,wecanallowsomepreprocessingthat

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。