STUDY ON A CHOICE OF HUB NODES IN A ROAD NETWORK AND ITS PARTITIONING BASED ON THE EXTENDED CONCEPT OF EIGENVECTOR CENTRALITY

• KOBAYASHI Shun-ichi

  金沢大学　理工研究域環境デザイン学系

• WAKABAYASHI Keita

  西日本高速道路株式会社

• TSUBOKAWA Shutaro

  金沢大学大学院　自然科学研究科環境デザイン学専攻

• NAKAYAMA Shoichiro

  金沢大学　理工研究域環境デザイン学系

Bibliographic Information

Other Title

• 固有ベクトル中心性の概念を拡張したネットワーク上の拠点ノード抽出および領域分割手法の提案

Abstract

This article deals with a partitioning method of a road network based on the topological and geometrical information. Firstly, the authors extend the concept of the eigenvector centrality of an adjacency matrix by introducing a weight matrix based on the distance of specific nodes to modify the adjacency matrix. Secondly, based on the eigenvector centrality of these modified adjacency matrices, local centrality nodes are selected to represent sub-areas of the network area. Then, by Dijkstra's algorithm, the area are divided by the least distance from these local centrality nodes. According to numerical examples using real road networks of Shiga prefecture or of Hokuriku region, the proposed method can divide a road network into multiple sub-areas without large deviation.

Journal

• Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management)

  Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management) 74 (5), I_747-I_760, 2018

  Japan Society of Civil Engineers

Keywords

• road network
• partitioning
• adjacency matrix
• eigenvector centrality
• hub node

Details

• CRID: 1390001288108250112
• NII Article ID: 130007556266
• DOI: 10.2208/jscejipm.74.i_747
• ISSN: 21856540
• Web Site: https://www.jstage.jst.go.jp/article/jscejipm/74/5/74_I_747/_pdf
• Text Lang: ja
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed