東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Transportation shortest path search ...

Wang, Hui.

FindBook

Google Book

Amazon

博客來

Transportation shortest path search area model.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Transportation shortest path search area model./
作者:	Wang, Hui.
面頁冊數:	153 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0344.
Contained By:	Dissertation Abstracts International65-01B.
標題:	Engineering, Civil. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3119419
ISBN:	0496668159

Transportation shortest path search area model.
Wang, Hui.

Transportation shortest path search area model. - 153 p.

Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0344.

Thesis (Ph.D.)--The University of Tennessee, 2003.

Although many studies on shortest-path algorithms have been conducted in the past, few of them have considered the time and effort required to obtain and update the weight property of the network arcs. For transportation-related problems---due to the size and complexity of the network---preparing, updating, and transmitting the network database on which the shortest-path algorithms perform can be a challenge.

ISBN: 0496668159Subjects--Topical Terms:

783781
Engineering, Civil.

Transportation shortest path search area model.
LDR:02382nmm 2200301 4500 001 1840242
005 20050714101557.5
008 130614s2003 eng d
020 $a 0496668159
035 $a (UnM)AAI3119419
035 $a AAI3119419
040 $a UnM $c UnM
100 1 $a Wang, Hui. $3 836732
245 1 0 $a Transportation shortest path search area model.
300 $a 153 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0344.
500 $a Major Professor: Lee D. Han.
502 $a Thesis (Ph.D.)--The University of Tennessee, 2003.
520 $a Although many studies on shortest-path algorithms have been conducted in the past, few of them have considered the time and effort required to obtain and update the weight property of the network arcs. For transportation-related problems---due to the size and complexity of the network---preparing, updating, and transmitting the network database on which the shortest-path algorithms perform can be a challenge.
520 $a This study designed a Transportation Shortest Path Search Area (TSPSA) model to enhance the database preparation and updating step before any shortest-path search algorithm can start processing. Taking advantage of the characteristics of the transportation networks, this new TSPSA model divides a transportation network into hierarchical levels of areas, and uses an elliptical search area to reduce the amount of data required by existing methods. For testing the designed TSPSA model, the DC-Baltimore metropolitan area roadway network was selected as a performance case study. The network GIS map was obtained by translating Census 2000 Topologically Integrated Geographic Encoding and Referencing system (TIGER) files into GIS shape files.
520 $a The study concludes that the TSPSA model greatly reduces shortest-path search area data size, and increases the data transmitting speed between the information control center and its clients. It contributes to speeding up the shortest-path search process as a whole, as well as reducing the congestion obstacles in data transmission.
590 $a School code: 0226.
650 4 $a Engineering, Civil. $3 783781
650 4 $a Transportation. $3 555912
690 $a 0543
690 $a 0709
710 2 0 $a The University of Tennessee. $3 1022026
773 0 $t Dissertation Abstracts International $g 65-01B.
790 1 0 $a Han, Lee D., $e advisor
790 $a 0226
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3119419