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]

In this paper we present a formal framework for modelling a trajectory data warehouse (TDW), namely a data warehouse aimed at storing aggregate information on trajectories of moving objects, which also offers visual OLAP operations for data analysis. The data warehouse model includes both temporal and spatial dimensions, and it is flexible and general enough to deal with objects that are either completely free or constrained in their movements (e.g., they move along a road network). In particular, the spatial dimension and the associated concept hierarchy reflect the structure of the environment in which the objects travel. Moreover, we cope with some issues related to the efficient computation of aggregate measures, as needed for implementing roll-up operations. The TDW and its visual interface allow one to investigate the behaviour of objects inside a given area as well as the movements of objects between areas in the same neighbourhood. A user can easily navigate the aggregate measures obtained from OLAP queries at different granularities, and get overall views in time and in space of the measures, as well as a focused view on specific measures, spatial areas, or temporal intervals. We discuss two application scenarios of our TDW, namely road traffic and vessel movement analysis, for which we built prototype systems. They mainly differ in the kind of information available for the moving objects under observation and their movement constraints. [ABSTRACT FROM AUTHOR]

The ever-increasing volume of spatial data has greatly challenged our ability to extract useful but implicit knowledge from them. As an important branch of spatial data mining, spatial outlier detection aims to discover the objects whose non-spatial attribute values are significantly different from the values of their spatial neighbors. These objects, called spatial outliers, may reveal important phenomena in a number of applications including traffic control, satellite image analysis, weather forecast, and medical diagnosis. Most of the existing spatial outlier detection algorithms mainly focus on identifying single attribute outliers and could potentially misclassify normal objects as outliers when their neighborhoods contain real spatial outliers with very large or small attribute values. In addition, many spatial applications contain multiple non-spatial attributes which should be processed altogether to identify outliers. To address these two issues, we formulate the spatial outlier detection problem in a general way, design two robust detection algorithms, one for single attribute and the other for multiple attributes, and analyze their computational complexities. Experiments were conducted on a real-world data set, West Nile virus data, to validate the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US. [ABSTRACT FROM AUTHOR]

With the proliferation of mobile computing, the ability to index efficiently the movements of mobile objects becomes important. Objects are typically seen as moving in two-dimensional (x,y) space, which means that their movements across time may be embedded in the three-dimensional (x,y,t) space. Further, the movements are typically represented as trajectories, sequences of connected line segments. In certain cases, movement is restricted; specifically, in this paper, we aim at exploiting that movements occur in transportation networks to reduce the dimensionality of the data. Briefly, the idea is to reduce movements to occur in one spatial dimension. As a consequence, the movement occurs in two-dimensional (x,t) space. The advantages of considering such lower-dimensional trajectories are that the overall size of the data is reduced and that lower-dimensional data is to be indexed. Since off-the-shelf database management systems typically do not offer higher-dimensional indexing, this reduction in dimensionality allows us to use existing DBMSes to store and index trajectories. Moreover, we argue that, given the right circumstances, indexing these dimensionality-reduced trajectories can be more efficient than using a three-dimensional index. A decisive factor here is the fractal dimension of the network-the lower, the more efficient is the proposed approach. This hypothesis is verified by an experimental study that incorporates trajectories stemming from real and synthetic road networks. [ABSTRACT FROM AUTHOR]

This paper gives the definitions of transport telematics and intelligent transport systems (ITS), and describes the basic pre-conditions, situation and market of ITS as well as its applications (products and services) in Europe. Availability of navigable digital maps is emphasized as a major premise. Strategic aspects and key issues for ITS development are explained. Current weaknesses and prospects for ITS services in 20 years are discussed. It is concluded that ITS will make a major contribution to the sustainable development of our society, because it increases our mobility without additional environmental burdens. [ABSTRACT FROM AUTHOR]

The evolution of GIS-T is characterized in three stages: the map view, the navigational view, and the behavioral view. The static nature of the map view favors applications related to inventory and description, and raises difficult questions of accuracy and interoperability. The navigational view adds concerns for connectivity and planarity, and the storage of time-dependent attributes. Navigation also raises issues of representation related to scale, including the need for lane-level connectivity. The behavioral view stems from the work of Hägerstrand, treating transportation events as dynamic and occurring within the largely static transportation space. Appropriate representations for the behavioral view have still to be worked out. In all three cases the legacies of prior technologies and perspectives are still evident. The paper presents a series of research challenges, dealing with standards, representation, unambiguous communication, economic models, response to new technologies, and application of knowledge gained from GIS-T and ITS research to other fields. [ABSTRACT FROM AUTHOR]

Transportation systems exist to improve individual accessibility. However, emerging applications of GIS in transportation (GIS-T) and intelligent transportation system (ITS) focus on throughput (the amount of system flow) rather than accessibility. Throughput is related but not equivalent to accessibility. Sensitive transportation planning requires rigorous, realistic and tractable accessibility measures. This paper reports on the development of GIS software that implement space-time accessibility measures (STAMs). The STAMs reflect the benefits that individuals receive from the transportation system. They are easily interpreted, particularly with respect to changes in accessibility. The STAMs also consider the locations and travel velocities dictated by the transportation system as well as individuals’ daily activity schedules. Tractable computational procedures allow calculation of the STAMs for detailed, urban-scale transportation networks. A prototype ArcInfo$^\circledR$-linked software system that runs on Windows NT$^\circledR$ or Sun Solaris$^\circledR$ platform implements the STAMs with user-friendly interfaces and project management tools. [ABSTRACT FROM AUTHOR]

Disaggregate travel data is not new to urban transportation planning studies, but it is infrequently handled in a GIS environment. With the evolution of urban travel demand models from aggregate models to disaggregate models and from a trip-based paradigm to an activity-based paradigm, there is a growing need of managing disaggregate travel data with spatial and temporal components in a GIS environment. At the data organization level, the main challenge is to efficiently store the data by minimizing redundancy while maintaining the complex relationships among the data items. The data organization should allow users to retrieve and visualize disaggregate travel data according to various possible combinations of spatial, temporal, and attribute criteria. This paper presents an implementation that employs a relational database approach and dynamic segmentation to organize the spatial, temporal, and attribute components in a sample travel diary data set. Discussions of the benefits and shortcomings associated with this approach are provided, along with suggestions for future research. [ABSTRACT FROM AUTHOR]

One of the impediments to the implementation of ITS is the lack of map database interoperability. Centreline databases are available from a number of sources, but few were designed specifically for ITS. Consequently there are a variety of problems—coordinate inaccuracy, errors of omission and commission, missing or wrong street names, incorrect topology—that are compounded when communicating parties use databases from different vendors. Many ITS applications (e.g., emergency response, ATIS) rely on the exchange of messages in which location is a component. Map error and interoperability problems can result in a variety of practical difficulties, from inappropriate vehicle routing to delays in delivery of critical services. These problems can be addressed by (a) standards for map databases, (b) intelligent messaging, (c) national integration efforts to improve database quality in the long term. This paper examines the dimensions of the problem, and describes solutions currently under development. [ABSTRACT FROM AUTHOR]

Dynamic traffic assignment (DTA) is at the heart of much ITS research. Assigning traffic, whether for planning purposes or for real time route guidance, is a difficult problem. Recent advances in user-optimal dynamic traffic assignment have built on the methods developed for static user-optimal assignments. Since assignment models are complex, they will not use many of the network analysis functions found in commercial GIS packages. Custom software will have to be developed. In this paper we explore the problems faced in solving static and dynamic assignments and relate those problems to information that is likely to be based in a traffic control center’s GIS database. Because of the size of the problem and the need for faster-than-real-time analysis, how and when data is transferred between a GIS to analysis modules is important. Further, many approaches for GIS software design and spatial data handling, such as OOP and dynamic segmentation, may impose too much overhead to be of much use in time-sensitive ITS applications. [ABSTRACT FROM AUTHOR]

Effective path finding has been identified as an important requirement for dynamic route guidance in Intelligent Transportation Systems (ITS). Path finding is most efficient if the all-pair (shortest) paths are precomputed because path search requires only simple lookups of the precomputed path views. Such an approach however incurs path view maintenance (computation and update) and storage costs which can be unrealistically high for large ITS networks. To lower these costs, we propose a Hierarchical Path View Model (HPVM) that partitions an ITS road map, and then creates a hierarchical structure based on the road type classification. HPVM includes a map partition algorithm for creating the hierarchy, path view maintenance algorithms, and a heuristic hierarchical path finding algorithm that searches paths by traversing the hierarchy. HPVM captures the dynamicity of traffic change patterns better than the ITS path finding systems that use the hierarchical$A$ * approach because: (1) during path search, HPVM traverses the hierarchy by dynamically selecting the connection points between two levels based on up-to-date traffic, and (2) HPVM can reroute the high-speed road traffic through local streets if needed. In this paper, we also present experimental results used to benchmark HPVM and to compare HPVM with alternative ITS path finding approaches, using both synthetic and real ITS maps that include a large Detroit map (> 28,000 nodes). The results show that the HPVM incurs much lower costs in path view maintenance and storage than the non-hierarchical path precomputation approach, and is more efficient in path search than the traditional ITS path finding using $A$* or hierarchical $A$* algorithms. [ABSTRACT FROM AUTHOR]

Comments on transportation as one of the most important geographic phenomenon. Emergence of the term intelligent transportation systems; Exploration of the issue evolving rules for geographic information systems; Impact of the emergence of geographic information and intelligent transportation systems on the way people deal with transportation.