Real world representation of a road network for route planning in GIS

被引:45
作者
Sadeghi-Niaraki, Abolghasem [1 ]
Varshosaz, Masood [2 ]
Kim, Kyehyun [1 ]
Jung, Jason J. [3 ]
机构
[1] Inha Univ, Dept Geoinformat Eng, Inchon, South Korea
[2] KN Toosi Univ Tech, Dept Geodesy & Geomant Eng, Tehran, Iran
[3] Yeungnam Univ, Dept Comp Eng, Gyongsan, South Korea
关键词
Route planning; Sensitivity analysis; GIS; AHP; Road network; Impedance model; ANALYTIC HIERARCHY PROCESS; SENSITIVITY-ANALYSIS; DECISION-MAKING; TRANSPORTATION; UNCERTAINTY; MODEL;
D O I
10.1016/j.eswa.2010.12.123
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper addresses a methodology to properly represent a road network in the geographic information system (GIS) for network analysis. Over the years, the real world has become too complex to model properly within a given information system, such as GIS. Ideally, when the real world is represented as accurately as possible, a GIS can answer a question in its virtual world that coincides with the exact answer in the real world. However, existing methods related to impedance modeling for each segment of a road network in a route planning analysis that includes only a distance or time variable do not give proper results. Hence, this study investigates how a road network can represent the real world in a GIS and offer route planning tools. To address this, first, additional realistic variables are taken into account. These include weather, sight-seeing information, road type, and so on. Second, to combine these variables, an impedance model (IM) using the analytical hierarchical process (AHP) method is proposed. Finally, all of the models are implemented and verified with a sensitivity analysis. The models were successfully implemented in this work. All of the paths of the route planning analysis were successfully matched with the drivers' paths that would normally be chosen in reality. It is anticipated that the use of other techniques such as analytical network process (ANP) in addition to AHP would be useful to overcome the aforementioned problem. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:11999 / 12008
页数:10
相关论文
共 55 条
  • [1] [Anonymous], PROJECT REPORT
  • [2] [Anonymous], 1994, 209 TRANSP RES BOARD
  • [3] [Anonymous], THESIS KN TOOSI U TE
  • [4] [Anonymous], 2003, Linear programming 2: theory and extensions
  • [5] [Anonymous], APA J
  • [6] [Anonymous], ISPRS 2004 C IST TUR
  • [7] [Anonymous], INVESTIGATION UNPUB
  • [8] [Anonymous], 2004, THESIS PORTLAND STAT
  • [9] [Anonymous], TRAFFIC ENG THEORY A
  • [10] [Anonymous], PREDICTION PROJECTIO