Search

In recent years, the number of motor vehicles in the country has risen rapidly. Traffic demand has continued to grow, while land resources, capital and energy have become increasingly tense. The development trend of urban transport system is not optimistic. Especially in the face of major events, vehicle evacuation suddenly increased, which is a serious planning for the evacuation of a serious challenge. Reasonable and accurate implementation of the emergency evacuation plan is to make the evacuation time at least, to minimize the major traffic congestion protection. Among them, route selection and traffic flow distribution are the core contents of emergency evacuation plan. In this paper, traffic emergency evacuation of major activities is taken as the research object, and the state vector of each road is introduced into the navigation system according to the linking analysis algorithm thought. The network model of evacuation route selection is established by using the theory of spatial diversity and the theory of minimum cost maximum flow, and an empirical analysis is made on the road network. Based on the research, the emergency evacuation plan for large-scale activities is proposed, and the theory and method system of emergency evacuation are enriched, which can help with formulating more reasonable and effective traffic management policies according to the characteristics of emergency evacuation, meanwhile we provide decision-making basis for urban emergency evacuation transportation planning and management. An experimental evaluation is also conducted with the real data from city of Beijing, in aspects of effectiveness and efficacy. [ABSTRACT FROM AUTHOR]

Reduction of greenhouse gas (GHG) emissions from transportation is an essential part of the efforts to prevent global warming and climate change. Eco-routing, which enables drivers to use the most environmentally friendly routes, is able to substantially reduce GHG emissions from vehicular transportation. The foundation of eco-routing is a weighted-graph representation of a road network in which road segments, or edges, are associated with eco-weights that capture the GHG emissions caused by traversing the edges. Due to the dynamics of traffic, the eco-weights are best modeled as being time dependent and uncertain. We formalize the problem of assigning a time-dependent, uncertain eco-weight to each edge in a road network based on historical GPS records. In particular, a sequence of histograms is employed to describe the uncertain eco-weight of an edge at different time intervals. Compression techniques, including histogram merging and buckets reduction, are proposed to maintain compact histograms while retaining their accuracy. In addition, to better model real traffic conditions, virtual edges and extended virtual edges are proposed in order to represent adjacent edges with highly dependent travel costs. Based on the techniques above, different histogram aggregation methods are proposed to accurately estimate time-dependent GHG emissions for routes. Based on a 200-million GPS record data set collected from 150 vehicles in Denmark over two years, a comprehensive empirical study is conducted in order to gain insight into the effectiveness and efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

Historic traffic information is valuable in transportation analysis and planning, e.g., evaluating the reliability of routes for representative source-destination pairs. Also, it can be utilized to provide efficient and effective route-search services. In view of these applications, we propose the k traffic-tolerant paths ( TTP) problem on road networks, which takes a source-destination pair and historic traffic information as input, and returns k paths that minimize the aggregate (historic) travel time. Unlike the shortest path problem, the TTP problem has a combinatorial search space that renders the optimal solution expensive to find. First, we propose an exact algorithm with effective pruning rules to reduce the search time. Second, we develop an anytime heuristic algorithm that makes 'best-effort' to find a low-cost solution within a given time limit. Extensive experiments on real and synthetic traffic data demonstrate the effectiveness of TTP and the efficiency of our proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a transportation spatio-temporal system that efficiently converts traffic video data into vehicular motion information in spatio-temporal databases for a variety of transportation applications. The proposed transportation spatio-temporal system interpolates the vehicle trajectory data (i.e., time, location, and speed), which are extracted from video, and integrates them with spatial road information for storage of dynamic transportation environments. The proposed transportation spatio-temporal system can mitigate data storage and retrieval issues related to storing large amounts of traffic video. Moreover, users can manage and operate multiform and multidimensional traffic data in a spatio-temporal transportation environment. The proposed approach is demonstrated for typical transportation applications. The experimental results show that the proposed transportation spatio-temporal system has excellent potential for addressing issues related to storage of large amounts of traffic video data. [ABSTRACT FROM AUTHOR]

Route planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of planning unobstructed paths in traffic-aware spatial networks (TAUP queries) to avoid potential traffic congestions. We propose two probabilistic TAUP queries: (1) a time-threshold query like 'what is the path from the check-in desk to the flight SK 1217 with the minimum congestion probability to take at most 45 minutes?', and (2) a probability-threshold query like 'what is the fastest path from the check-in desk to the flight SK 1217 whose congestion probability is less than 20 %?'. These queries are mainly motivated by indoor space applications, but are also applicable in outdoor spaces. We believe that these queries are useful in some popular applications, such as planning unobstructed paths for VIP bags in airports and planning convenient routes for travelers. The TAUP queries are challenged by two difficulties: (1) how to model the traffic awareness in spatial networks practically, and (2) how to compute the TAUP queries efficiently under different query settings. To overcome these challenges, we construct a traffic-aware spatial network G( V, E) by analyzing uncertain trajectories of moving objects. Based on G( V, E), two efficient algorithms are developed to compute the TAUP queries. The performances of TAUP queries are verified by extensive experiments on real and synthetic spatial data. [ABSTRACT FROM AUTHOR]

In this paper, we study Resource Constrained Best Upgrade Plan (BUP) computation in road network databases. Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. In the single-pair version of BUP, the input includes a source and a destination in G, and a budget B (resource constraint). The goal is to identify which upgradable edges should be upgraded so that the shortest path distance between source and destination (in the updated network) is minimized, without exceeding the available budget for the upgrade. In the multiple-pair version of BUP, a set Q of source-destination pairs is given, and the problem is to choose for upgrade those edges that lead to the smallest sum of shortest path distances across all pairs in Q, subject to budget constraint B. In addition to transportation networks, the BUP query arises in other domains too, such as telecommunications. We propose a framework for BUP processing and evaluate it with experiments on large, real road networks. [ABSTRACT FROM AUTHOR]

Query processing for trajectory data is a hot topic in the field of moving objects databases (MODs). Most of the previous research work focused on the Euclidean space, and the uncertain trajectories are represented as sheared cylinders. However, in many applications (e.g. traffic management), the movements of moving objects (MOs) are constrained by the road network environments, which makes the previous methods ineffective. In this paper, we firstly construct an uncertain trajectory model, which is composed of a sequence of segment units with earliest arrival time and latest departure time, based on the assuming availability of a maximum speed on each road segment. Secondly, we present a partition-based uncertain trajectory index (PUTI) to facilitate the search of possible MOs within the space and time range in the road networks based on the uncertain trajectory model. It provides appropriate groups to gather segment units of trajectories according to their network distances. Finally, an efficient algorithm for range query is proposed by leveraging the index. The experiments on two datasets demonstrate that the uncertain trajectory model is effective, and PUTI also significantly outperforms the network distance based MON-tree on range query. [ABSTRACT FROM AUTHOR]

In a traffic-aware route search (TARS), the user provides start and target locations and sets of search terms. The goal is to find the fastest route from the start location to the target via geographic entities (points of interest) that correspond to the search terms, while taking into account variations in the travel speed due to changes in traffic conditions, and the possibility that some visited entities will not satisfy the search requirements. A TARS query may include temporal constraints and order constraints that restrict the order by which entities are visited. Since TARS generalizes the Traveling-Salesperson Problem, it is an NP-hard problem. Thus, it is unlikely to find a polynomial-time algorithm for evaluating TARS queries. Hence, we present in this paper three heuristics to answer TARS queries-a local greedy approach, a global greedy approach and an algorithm that computes a linear approximation to the travel speeds, formulates the problem as a Mixed Integer Linear Programming (MILP) problem and uses a solver to find a solution. We provide an experimental evaluation based on actual traffic data and show that using a MILP solver to find a solution is effective and can be done within a limited running time in many real-life scenarios. The local-greedy approach is the least effective in finding a fast route, however, it has the best running time and it is the most scalable. [ABSTRACT FROM AUTHOR]