Engineering Highway Hierarchies工程等級分路

Engineering Highway Hierarchies工程等級分路

ID:39065669

大小:426.03 KB

頁數(shù):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工程等級分路》由會員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫。

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

2、ngroutineiterativelyperformstwosteps:?rst,itremovesedgesthatonlyappearonshortestpathsclosetosourceortarget;second,itidenti?eslow-degreenodesandbypassesthembyintroducingshortcutedges.TheresultinghierarchyofhighwaynetworksisthenusedinaDijkstra-likebidirectionalqueryalgorithmtoconsiderablyreduceth

3、esearchspacesizewithoutlosingexactness.Thecrucialfactisthat`faraway'fromsourceandtargetitissuf?cienttoconsideronlyhigh-leveledges.Variousexperimentswithreal-worldroadnetworkscon?rmtheperformanceofourapproach.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.Therearealsomanyapplicationslikelogisticplanningortraf?csimulationthatneedtosolveahugenumberofshortest-pathqueries.InprinciplewecoulduseDijkstra'salgorithm[1].Butforlargeroadn

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

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動畫的文件,查看預(yù)覽時可能會顯示錯亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負(fù)責(zé)整理代發(fā)布。如果您對本文檔版權(quán)有爭議請及時聯(lián)系客服。
3. 下載前請仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時可能由于網(wǎng)絡(luò)波動等原因無法下載或下載錯誤,付費(fèi)完成后未能成功下載的用戶請聯(lián)系客服處理。