Visual analytics of flight trajectories for uncovering decision making strategies

In air traffic management and control, movement data describing actual and planned flights are used for planning, monitoring and post-operation analysis purposes with the goal of increased efficient utilization of air space capacities (in terms of delay reduction or flight efficiency), without compromising the safety of passengers and cargo, nor timeliness of flights. From flight data, it is possible to extract valuable information concerning preferences and decision making of airlines (e.g. route choice) and air traffic managers and controllers (e.g. flight rerouting or optimizing flight times), features whose understanding is intended as a key driver for bringing operational performance benefits. In this paper, we propose a suite of visual analytics techniques for supporting assessment of flight data quality and data analysis workflows centred on revealing decision making preferences

A Force-Directed Approach for Offline GPS Trajectory Map Matching

We present a novel algorithm to match GPS trajectories onto maps offline (in batch mode) using techniques borrowed from the field of force-directed graph drawing. We consider a simulated physical system where each GPS trajectory is attracted or repelled by the underlying road network via electrical-like forces. We let the system evolve under the action of these physical forces such that individual trajectories are attracted towards candidate roads to obtain a map matching path. Our approach has several advantages compared to traditional, routing-based, algorithms for map matching, including the ability to account for noise and to avoid large detours due to outliers in the data whilst taking into account the underlying topological restrictions (such as one-way roads). Our empirical evaluation using real GPS traces shows that our method produces better map matching results compared to alternative offline map matching algorithms on average, especially for routes in dense, urban areas.Comment: 10 pages, 12 figures, accepted version of article submitted to ACM SIGSPATIAL 2018, Seattle, US

The Shortest Path to Happiness: Recommending Beautiful, Quiet, and Happy Routes in the City

When providing directions to a place, web and mobile mapping services are all able to suggest the shortest route. The goal of this work is to automatically suggest routes that are not only short but also emotionally pleasant. To quantify the extent to which urban locations are pleasant, we use data from a crowd-sourcing platform that shows two street scenes in London (out of hundreds), and a user votes on which one looks more beautiful, quiet, and happy. We consider votes from more than 3.3K individuals and translate them into quantitative measures of location perceptions. We arrange those locations into a graph upon which we learn pleasant routes. Based on a quantitative validation, we find that, compared to the shortest routes, the recommended ones add just a few extra walking minutes and are indeed perceived to be more beautiful, quiet, and happy. To test the generality of our approach, we consider Flickr metadata of more than 3.7M pictures in London and 1.3M in Boston, compute proxies for the crowdsourced beauty dimension (the one for which we have collected the most votes), and evaluate those proxies with 30 participants in London and 54 in Boston. These participants have not only rated our recommendations but have also carefully motivated their choices, providing insights for future work.Comment: 11 pages, 7 figures, Proceedings of ACM Hypertext 201

A Portfolio Theory of Route Choice

Although many individual route choice models have been proposed to incorporate travel time variability as a decision factor, they are typically still deterministic in the sense that the optimal strategy requires choosing one particular route that maximizes utility. In contrast, this study introduces an individual route choice model where choos- ing a portfolio of routes instead of a single route is the best strategy for a rational traveler who cares about both journey time and lateness when facing stochastic net- work conditions. The model is then tested with GPS data collected in metropolitan Minneapolis-St. Paul, Minnesota. Our data suggest strong correlation among link speed when analyzing morning commute trips. There is no single dominant route (de- fined here as a route with the shortest travel time for a 15 day period) in 18% of cases when links travel times are correlated. This paper demonstrates that choosing a port- folio of routes could be the rational choice of a traveler who wants to optimize route decisions under variability.Transportation planning, route choice, travel behavior, link performance

People don't use the shortest path

Most recent route choice models, following either Random Utility Maximization or rule-based paradigm, require explicit enumeration of feasible routes. The quality of model estimation and prediction is sensitive to the appropriateness of consideration set. However, few empirical studies of revealed route characteristics have been reported in the literature. Such study could also help practitioners and researchers evaluate widely applied shortest path assumptions. This study aims at bridging the gap by evaluating morning commute routes followed by residents at the Twin Cities, Minnesota. Accurate GPS and GIS data were employed to reveal routes people utilized. Findings from this study could also provide guidance for future efforts in building better travel demand models.Rationality, travel behavior, transport geography, commuting, transportation networks

The path inference filter: model-based low-latency map matching of probe vehicle data

We consider the problem of reconstructing vehicle trajectories from sparse sequences of GPS points, for which the sampling interval is between 10 seconds and 2 minutes. We introduce a new class of algorithms, called altogether path inference filter (PIF), that maps GPS data in real time, for a variety of trade-offs and scenarios, and with a high throughput. Numerous prior approaches in map-matching can be shown to be special cases of the path inference filter presented in this article. We present an efficient procedure for automatically training the filter on new data, with or without ground truth observations. The framework is evaluated on a large San Francisco taxi dataset and is shown to improve upon the current state of the art. This filter also provides insights about driving patterns of drivers. The path inference filter has been deployed at an industrial scale inside the Mobile Millennium traffic information system, and is used to map fleets of data in San Francisco, Sacramento, Stockholm and Porto.Comment: Preprint, 23 pages and 23 figure

Value of Reliability: High Occupancy Toll Lanes, General Purpose Lanes, and Arterials

In the Minneapolis-St. Paul region (Twin Cities), the Minnesota Department of Transportation (MnDOT) converted the Interstate 394 High Occupancy Vehicle (HOV) lanes to High Occupancy Toll (HOT) lanes (or MnPASS Express Lanes). These lanes allow single occupancy vehicles (SOV) to access the HOV lanes by paying a fee. This fee is adjusted according to a dynamic pricing system that varies with the current demand. This paper estimates the value placed by the travelers on the HOT lanes because of improvements in travel time reliability. This value depends on how the travelers regard a route with predictable travel times (or small travel time variability) in comparison to another with unpredictable travel times (or high travel time variability). For this purpose, commuters are recruited and equipped with Global Positioning System (GPS) devices and instructed to commute for two weeks on each of three plausible alternatives between their home in the western suburbs of Minneapolis eastbound to work in downtown or the University of Minnesota: I-394 HOT lanes, I-394 General Purpose lanes (untolled), and signalized arterials close to the I-394 corridor. They are then given the opportunity to travel on their preferred route after experiencing each alternative. This revealed preference data is then analyzed using mixed logit route choice models. Three measures of reliability are explored and incorporated in the estimation of the models: standard deviation (a classical measure in the research literature); shortened right range (typically found in departure time choice models); and interquartile range (75th - 25th percentile). Each of these measures represents distinct ways about how travelers deal with different sections of reliability. In all the models, it was found that reliability was valued highly (and statistically significantly), but differently according to how it was defined. The estimated value of reliability in each of the models indicates that commuters are willing to pay a fee for a reliable route depending on how they value their reliability savings.time reliability, GPS, route choice, random utility, I-394 HOT, MnPass, mixed logit