Finding least-cost paths across a continuous raster surface with discrete vector networks

The problem of finding the least-cost path from a source point to a destination point can be dealt with by routing across a continuous surface or routing along a discrete network. The solutions within these two contexts are linked to the use of a raster- or a vector-based least-cost path algorithm. This study presents a technique which integrates raster- and vector-based least-cost path algorithms for determining the least-cost path across a continuous raster surface with discrete vector networks. The technique incorporates ancillary vector data sets that are required to examine the travel cost at each link, connections between nodes, and the representation of intersecting links in the discrete vector network into raster-based least-cost path analysis. The integrated technique presented here is applicable to all-terrain vehicle navigation where a continuous raster surface and discrete vector networks need to be considered simultaneously in order to find least-cost paths. This paper describes the concept behind, and details of, the integrated technique. Applications of the technique with synthetic and real-world data sets are also presented. They provide proof that the technique is effective in finding least-cost paths across a continuous raster surface with discrete vector networks.     

基于交通网络几何和语义(交通)规则集成的公交换乘研究

换乘信息特别是基于地理信息系统技术的图文换乘信息服务,已经成为城市公共交通信息服务、线网规划和线路优化调整的重要指标与内容。但是公共交通线网具有特殊的网络特征和拓扑关系,它不同于城市道路网络,因此公共交通换乘不能简单应用于目前的最优路径算法,例如Dijkstra算法。本文将通过对公共交通线网的空间特征和语义(交通)规则分析,建立城市交通网络的几何和语义连通性的集成关系。几何连通性是语义连通性的基础和先决条件,而语义连通性是公共交通网络拓扑的核心。基于语义连通性的公共交通线网拓扑关系提升公共交通换乘算法的效率和信息准确度,任何两个站点之间的最优路径可以被迅速获取而不需要检索整个网络的几何拓扑信息。并且该最优换乘路径考虑到最少换乘次数、出行距离最短、费用最少、途经站点最少和换乘中最短步行距离等多目标换乘。     

A topographically preserved road‐network tile model and optimal routing method for virtual globes

Virtual globes enable the combination of heterogeneous datasets for optimal routing analyses in transportation, environmental ecology, and construction engineering. In this study, considering the advantages of the hierarchical tiling structure and topography of virtual globes, we propose a tile‐based optimal routing method for large‐scale road networks in a virtual globe. This method designs a topographically preserved road‐network tile model by partitioning roads into tiles and constructs the road‐network pyramid from the bottom to the top. During construction, a TileArc is calculated and flagged as the shortest path in a tile. Based on the built road‐network pyramid carrying hierarchical TileArcs, a multi‐level and flexible shortest path query can be executed efficiently. The proposed method is implemented with large road networks with different road grades in a virtual globe. Experimental results verify its validity, efficiency, and exactness. Moreover, the length of the shortest path with surface distance is approximately 1.3 times longer than that with Euclidean distance.     

Towards an Open Source Analysis Toolbox for Street Network Comparison: Indicators,Tools and Results of a Comparison of OSM and the Official Austrian Reference Graph

This article presents a novel open source toolbox for street network comparison based on the Sextante geoprocessing framework for the open source Geographic Information System Quantum GIS (QGIS). In the spirit of open science, the toolbox enables researchers worldwide to assess the quality of street networks such as OpenStreetMap (OSM) by calculating key performance indicators commonly used in street network comparison studies. Additionally, we suggest two new performance indicators for turn restriction and one‐way street comparisons specifically aimed at testing street network quality for routing. We demonstrate the use of this toolbox by comparing OSM and the official Austrian reference graph “Graph Integration Platform” (GIP) in the greater Vienna region.     

城市道路网元胞模式分析的网络景观指数分析法

道路网元胞的组成及其配置构成了特定的网络景观,受启发于元胞和景观格局中斑块的相似性,借鉴景观格局分析中的景观指数分析法,提出了一种城市道路网元胞模式分析的新方法——网络景观指数分析法。该方法基于道路类型生成不同类别的元胞,计算网络景观指数,并通过相关分析与因子分析挖掘主要因子,进而解释主要因子及代表指数在道路网模式分析中的含义。应用该方法计算了中国34个城市街道网络的24个指标,发现了4个主要因子:元胞的空间分布与多样性、元胞最大尺寸与延展性差异、元胞平均延展性和元胞平均尺寸与形状复杂度。反映到道路网中,描述了道路的集聚与分散特征、道路类型的多样性、道路网的规则程度等特征。     

面向空间延迟可容忍网络的路由协议仿真研究

随着空间通信的发展和卫星节点的增加,空间DTN网络中卫星节点之间的路由的重要性日益明显,大量复杂的卫星网络路由方案相继提出。针对空间DTN网络具有规律性与可预见性,研究了基于卫星节点运动接触规律 (CGR)路由协议。在ONE仿真实验平台下,对真实卫星网络场景进行了仿真实验,并对比了CGR、Epidemic与Prophet路由协议的性能。实验结果表明,相比于Epidemic与Prophet,CGR在消息交付率、平均延时和网络开销比等方面的性能优越。     

交通限制条件下的最短路径算法分析与优化

通过对交通网络本身的特点及要求的分析与研究，介绍了一些适合道路网的经典最短路算法和数据存贮模式，探讨了在交通网络路线优化过程中需要特别处理的几个问题，如路口延误、禁行状态等，并在理论上给出了相应的解决方案。最后给出了一个路径搜索的实例。     

Framework for constructing multimodal transport networks and routing using a graph database: A case study in London

Most prior multimodal transport networks have been organized as relational databases with multilayer structures to support transport management and routing; however, database expandability and update efficiency in new networks and timetables are low due to the strict database schemas. This study aimed to develop multimodal transport networks using a graph database that can accommodate efficient updates and extensions, high relation-based query performance, and flexible integration in multimodal routing. As a case study, a database was constructed for London transport networks, and routing tests were performed under various conditions. The constructed multimodal graph database showed stable performance in processing iterative queries, and efficient multi-stop routing was particularly enhanced. By applying the proposed framework, databases for multimodal routing can be readily constructed for other regions, while enabling responses to diversified routings, such as personalized routing through integration with various unstructured information, due to the flexible schema of the graph database.     

Measuring the Reliability of Wheelchair User Route Planning based on Volunteered Geographic Information

The development of a wheelchair user friendly route planning application inherits a number of special requirements and details that need to be considered during the generation of the routing graph and the corresponding algorithm, making this task much more complex than car or pedestrian related applications. Each wheelchair type and, more importantly, each individual user might have different needs with regards to the way condition or other criteria. This study proposes a new approach to route planning for wheelchair users tailored for individual and personal requirements provided by the user and the calculation of a reliability factor of the computed wheelchair path. The routing graph is based on the freely available Volunteered Geographic Information (VGI) retrieved from the OpenStreetMap (OSM) project. The newly created algorithm is evaluated and tested for a selected area in Bonn, Germany. A new reliability factor is introduced that gives direct feedback about the quality of the generated path. Similar factor estimations can also be utilized for multiple route planning applications where VGI or other commercial or administrative data is implemented and more detailed factors than a simple geometric representation of a street network are of importance.     

An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning

Human beings' intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms.It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic,so as to improve running efficiency and suitability of shortest path algorithm for traffic network.The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path.It is argued that the shortest path,no matter distance shortest or time shortest,is usually not the favorite of drivers in practice.Some factors difficult to expect or quantify influence the drivers' choice greatly.It makes the drivers prefer choosing a less shortest,but more reliable or flexible path to travel on.The presented optimum path algorithm,in addition to the improvement of the running efficiency of shortest path algorithms up to several times,reduces the emergence of those factors,conforms to the intellection characteristic of human beings,and is more easily accepted by drivers.Moreover,it does not require the completeness of networks in the lowest hierarchy and the applicability and fault tolerance of the algorithm have improved.The experiment result shows the advantages of the presented algorithm.The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.     

An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning

Human beings’ intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms. It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic, so as to improve running efficiency and suitability of shortest path algorithm for traffic network. The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path. It is argued that the shortest path, no matter distance shortest or time shortest, is usually not the favorite of drivers in practice. Some factors difficult to expect or quantify influence the drivers’ choice greatly. It makes the drivers prefer choosing a less shortest, but more reliable or flexible path to travel on. The presented optimum path algorithm, in addition to the improvement of the running efficiency of shortest path algorithms up to several times, reduces the emergence of those factors, conforms to the intellection characteristic of human beings, and is more easily accepted by drivers. Moreover, it does not require the completeness of networks in the lowest hierachy and the applicability and fault tolerance of the algorithm have improved. The experiment result shows the advantages of the presented algorithm. The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.     

A fast algorithm for finding K shortest paths using generalized spur path reuse technique

The problem of finding the K shortest paths (KSPs) between a pair of nodes in a road network is an important network optimization problem with broad applications. Yen's algorithm is a classical algorithm for exactly solving the KSP problem. However, it requires numerous shortest path searches, which can be computationally intensive for real large networks. This study proposes a fast algorithm by introducing a generalized spur path reuse technique. Using this technique, shortest paths calculated during the KSP finding process are stored. Accordingly, many shortest path searches can be avoided by reusing these stored paths. The results of computational experiments on several large‐scale road networks show that the introduced generalized spur path reuse technique can avoid more than 98% of shortest path searches in the KSP finding process. The proposed algorithm speeds up Yen's algorithm by up to 98.7 times in experimental networks.     

网络空间向量剖分法识别城市路网网格模式

将道路网络空间视为嵌在2D空间中的独立子空间,利用形态单一的线性单元剖分图结构的边,实现网络空间的栅格化;提取网格模式的典型特征,包括几何和拓扑特征,以栅格单元邻域为目标计算特征值,构建特征向量描述栅格单元,实现对象空间到特征空间的映射,构建空间向量场;基于支持向量机（support vector machine,SVM）实现网格模式分类;结合格式塔原则完善实验结果。将此方法应用于深圳市路网数据,实验结果表明能有效地识别网格模式。     

Transport link scanner: simulating geographic transport network expansion through individual investments

This paper introduces a GIS-based model that simulates the geographic expansion of transport networks by several decision-makers with varying objectives. The model progressively adds extensions to a growing network by choosing the most attractive investments from a limited choice set. Attractiveness is defined as a function of variables in which revenue and broader societal benefits may play a role and can be based on empirically underpinned parameters that may differ according to private or public interests. The choice set is selected from an exhaustive set of links and presumably contains those investment options that best meet private operator’s objectives by balancing the revenues of additional fare against construction costs. The investment options consist of geographically plausible routes with potential detours. These routes are generated using a fine-meshed regularly latticed network and shortest path finding methods. Additionally, two indicators of the geographic accuracy of the simulated networks are introduced. A historical case study is presented to demonstrate the model’s first results. These results show that the modelled networks reproduce relevant results of the historically built network with reasonable accuracy.     

Multi‐temporal transport network models for accessibility studies

Vehicle tracking is a spatio‐temporal source of high‐granularity travel time information that can be used for transportation planning. However, it is still a challenge to combine data from heterogeneous sources into a dynamic transport network, while allowing for network modifications over time. This article uses conceptual modeling to develop multi‐temporal transport networks in geographic information systems (GIS) for accessibility studies. The proposed multi‐temporal network enables accessibility studies with different temporal granularities and from any location inside the city, resulting in a flexible tool for transport and urban planning. The implemented network is tested in two case studies that focus on socially excluded people in a large global city, São Paulo, Brazil, including accessibility analyses from slum areas. It explores variations within a day and differences between transport modes across time. Case study results indicate how the accessibility is heterogeneous in low‐income regions.     

应用复杂网络理论的城市路网可靠性分析

城市路网作为一种关系居民日常生活、社会经济发展的重要网络,在受到暴雨洪水、交通堵塞以及遭遇破坏时,可能局部失效,进而影响整个路网的运输能力和效率。本文针对城市路网的拓扑特点,以复杂网络理论为基础,对两种不同布局结构的路网分别采用主方法和对偶方法建模,分析比较其复杂网络特性,并在此基础上进行了基于节点度和基于节点中介中心性的选择性破坏实验,最后分析了不同结构的路网在不同攻击策略下所表现出来的可靠性。     

Routing through open spaces – A performance comparison of algorithms

Abstract

Finding the shortest path through open spaces is a well-known challenge for pedestrian routing engines. A common solution is routing on the open space boundary, which causes in most cases an unnecessarily long route. A possible alternative is to create a subgraph within the open space. This paper assesses this approach and investigates its implications for routing engines. A number of algorithms (Grid, Spider-Grid, Visibility, Delaunay, Voronoi, Skeleton) have been evaluated by four different criteria: (i) Number of additional created graph edges, (ii) additional graph creation time, (iii) route computation time, (iv) routing quality. We show that each algorithm has advantages and disadvantages depending on the use case. We identify the algorithms Visibility with a reduced number of edges in the subgraph and Spider-Grid with a large grid size to be a good compromise in many scenarios.     

运用复杂网络方法分析城市道路网的鲁棒性

道路网的鲁棒性分析有助于预防或者降低恐怖袭击、自然灾害以及交通拥堵造成的损失。从开放街道地图上获得世界范围内的50个城市道路网，沿用复杂网络鲁棒性分析方法，运用连续删除模型和级联模型对以道路链相交关系表示的城市道路网进行了鲁棒性分析，同时对路网的鲁棒性与其拓扑模式间的关系进行了探讨。研究发现，对于路网的鲁棒性，运用连续删除模型和级联模型所得到的鲁棒性结果存在差异。其中，连续删除模型的道路网鲁棒性普遍较差；而级联模型的鲁棒性，不同路网之间的差别较大；对于同一模型下的度策略和介数策略，介数策略的破坏性大于度策略。对于路网鲁棒性与其拓扑模式的关系，在连续删除模型下，路网鲁棒性与度相关性呈现显著正相关，无标度与非无标度的路网鲁棒性有差异；在级联模型下，路网鲁棒性与度相关性不相关，无标度与非无标度的路网鲁棒性差异不显著。     

Identifying Critical Locations in a Spatial Network with Graph Theory

Effective management of infrastructural networks in the case of a crisis requires a prior analysis of the vulnerability of spatial networks and identification of critical locations where an interdiction would cause damage and disruption. This article presents a mathematical method for modelling the vulnerability risk of network elements which can be used for identification of critical locations in a spatial network. The method combines dual graph modelling with connectivity analysis and topological measures and has been tested on the street network of the Helsinki Metropolitan Area in Finland. Based on the results of this test the vulnerability risk of the network elements was experimentally defined. Further developments are currently under consideration for eventually developing a risk model not only for one but for a group of co‐located spatial networks.     

Conflation of OpenStreetMap and Mobile Sports Tracking Data for Automatic Bicycle Routing

This article investigates how workout trajectories from a mobile sports tracking application can be used to provide automatic route suggestions for bicyclists. We apply a Hidden Markov Model (HMM)‐based method for matching cycling tracks to a “bicycle network” extracted from crowdsourced OpenStreetMap (OSM) data, and evaluate its effective differences in terms of optimal routing compared with a simple geometric point‐to‐curve method. OSM has quickly established itself as a popular resource for bicycle routing; however, its high‐level of detail presents challenges for its applicability to popularity‐based routing. We propose a solution where bikeways are prioritized in map‐matching, achieving good performance; the HMM‐based method matched correctly on average 94% of the route length. In addition, we show that the extremely biased nature of the trajectory dataset, which is typical of volunteered user‐generated data, can be of high importance in terms of popularity‐based routing. Most computed routes diverged depending on whether the number of users or number of tracks was used as an indicator of popularity, which may imply varying preferences among different types of cyclists. Revising the number of tracks by diversity of users to surmount local biases in the data had a more limited effect on routing.