GIS-based最短路徑演算法之改良與測試分析

CHUR > College of Management > Department of Transportation Technology and Logistice Management > Seminar Papers > Item 987654321/29850

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/29850

Title:	GIS-based最短路徑演算法之改良與測試分析
Authors:	卓裕仁 Cho, Yuh-Jen
Contributors:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
Keywords:	最短路徑演算法;地理資訊系統;網路演算元件 shortest path algorithms;GIS;network analysis objects
Date:	2004
Issue Date:	2014-06-27 00:41:28 (UTC+8)
Abstract:	網路演算元件對於地理資訊系統（Geographic Information System, GIS）之應用甚為重要。最短路徑演算法（Shortest Path Algorithms）是網路分析的基礎工具，常做為其他更複雜網路問題演算法的基本求解元件。最短路徑演算法應用在GIS時，可能因路網結構的複雜度而影響到運算時間；為了能在較短的時間內求得最短路徑，有效率的演算法是不可或缺的。本研究選擇Dijkstra及Two-tree兩種演算法為基礎，並針對A-star搜尋法與上述兩種演算法之結合進行實證測試。由於A The Shortest Path Algorithm (SPA) is a very important element and tool for solving various network optimization problems. The network analysis objects are frequently applied on the Geographic Information System (GIS), which provides many functions to stor
Appears in Collections:	[Department of Transportation Technology and Logistice Management] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_m620_0190.pdf		35Kb	Adobe PDF	119	View/Open