English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55184/89457 (62%)
Visitors : 10666399      Online Users : 18
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/62351


    Title: 利用高低層路網加快最短路徑計算之實作
    Authors: 魏世杰;鄭宇辰
    Contributors: 淡江大學資訊管理學系
    Keywords: 最短路徑演算法;地標三角A;階層式路徑搜尋
    Date: 2009-05
    Issue Date: 2011-10-18 16:57:15 (UTC+8)
    Publisher: 世新大學資訊管理學系;中華民國資訊管理學會
    Abstract: 加快傳統Dijkstra最短路徑計算的方法,可依有無分群資訊輔助劃分為兩類。無分群資訊的方法例如雙向搜尋、直線距離A*、地標三角A*等雖可提昇效率,但隨路網變大,其提昇程度很快遇到瓶頸。有分群資訊輔助作法上,本文主要採用階層概念,將路網利用分群劃分為高低兩層級,高層路網由各低層路網的邊界點構成,找尋最短路徑時透過高層路網可減少展開低層節點數。實驗以台灣路網進行搜尋時間的評估,結果顯示,本實作方法能在數毫秒內完成最短路徑的搜尋。
    Relation: 第二十屆國際資訊管理學術研討會論文集=Proceedings of the 20th International Conference Information Management,10頁
    Appears in Collections:[Graduate Institute & Department of Information Management] Proceeding

    Files in This Item:

    File SizeFormat
    利用高低層路網加快最短路徑計算之實作_中文摘要.docx14KbMicrosoft Word83View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback