The Study of Shortest Path Search Based on Zone Partition Network

• Main Authors: Cherng Yi Cherng, 程怡誠
• Other Authors: Chuan-Fang Wang
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/83625692207302174982

碩士 === 國立交通大學 === 交通運輸研究所 === 89 === Route choices over transportation networks are operations required by many Geographic Information Systems applications. Such networks, typically modeled as graphs compose of nodes and links and represented as link relations, can be large and hence often need to be stored on secondary storage device. Route choice computation over such large persistent networks amounts to high I/O costs due to having to repeatedly bring in links from the link relation from storage into the main memory buffer for processing. This paper presents a comparative experimental evaluation of alternative graph clustering solutions in order to show the effectiveness in path choice processing over transportation networks. This paper develops a hierarchical clustering road technique, called spatial partition clustering. The experimental results are the foundation for establishing guidelines to select the best clustering technique based on the type of network.