T-PickSeer: Visual Analysis of Taxi Pick-up Point Selection Behavior

Taxi drivers often take much time to navigate the streets to look for passengers, which leads to high vacancy rates and wasted resources. Empty taxi cruising remains a big concern for taxi companies. Analyzing the pick-up point selection behavior can solve this problem effectively, providing suggestions for taxi management and dispatch. Many studies have been devoted to analyzing and recommending hot-spot regions of pick-up points, which can make it easier for drivers to pick up passengers. However, the selection of pick-up points is complex and affected by multiple factors, such as convenience and traffic management. Most existing approaches cannot produce satisfactory results in real-world applications because of the changing travel demands and the lack of interpretability. In this paper, we introduce a visual analytics system, T-PickSeer, for taxi company analysts to better explore and understand the pick-up point selection behavior of passengers. We explore massive taxi GPS data and employ an overview-to-detail approach to enable effective analysis of pick-up point selection. Our system provides coordinated views to compare different regularities and characteristics in different regions. Also, our system assists in identifying potential pick-up points and checking the performance of each pick-up point. Three case studies based on a real-world dataset and interviews with experts have demonstrated the effectiveness of our system.Comment: 10 pages, 10 figures; The 10th China Visualization and Visual Analytics Conferenc

IDENTIFYING AREA HOTSPOTS AND TAXI PICKUP TIMES USING SPATIAL DENSITY-BASED CLUSTERING

Taxis are one of the competitive sectors of transportation and are recognized as convenient and easy means of transportation to meet individual needs. However, in the operation of a taxi there are some problems that would make the taxi service less optimal, such as the difficulty with finding a taxi at specific hours, the imbalance between demand and taxi supplies, and the length of passengers waiting for a taxi. Therefore, to optimize taxi service, a knowledge base is needed for strategic management decision making. In the study, data of exploration taxis uses a DBSCAN algorithm aimed at identifying and clustering pickup hotspots based on time during weekday and weekend time from Queens, New York City. As for the features used which are pickup latitude and pickup longitude. Accuracy scores for modeling use coefficients to achieve accuracy scores of 0.80 on weekdays and 0.77 on weekends where the accuracy score falls into the accurate category in modeling. Results show that there are three areas of taxi pickup centers based on high taxi demand in January 2016, where they are at LaGuardia airport, John f. Kennedy international, and the area around Steinway Street

Trajectory data mining: A review of methods and applications

The increasing use of location-aware devices has led to an increasing availability of trajectory data. As a result, researchers devoted their efforts to developing analysis methods including different data mining methods for trajectories. However, the research in this direction has so far produced mostly isolated studies and we still lack an integrated view of problems in applications of trajectory mining that were solved, the methods used to solve them, and applications using the obtained solutions. In this paper, we first discuss generic methods of trajectory mining and the relationships between them. Then, we discuss and classify application problems that were solved using trajectory data and relate them to the generic mining methods that were used and real world applications based on them. We classify trajectory-mining application problems under major problem groups based on how they are related. This classification of problems can guide researchers in identifying new application problems. The relationships between the methods together with the association between the application problems and mining methods can help researchers in identifying gaps between methods and inspire them to develop new methods. This paper can also guide analysts in choosing a suitable method for a specific problem. The main contribution of this paper is to provide an integrated view relating applications of mining trajectory data and the methods used

An Ant-based Intelligent Design for Future Self-driving Commercial Car Service Strategy

The technology of self-driving cars will inevitably change the industry of taxis and ride-sharing cars that provide important commercial ground transportation services to travelers, tourists and local residents. There is no doubt that new techniques, business models and strategies will be needed to follow the use of self-driving cars. This paper focuses on a forward-looking research topic that route commercial, vacant self-driving vehicles so that the values to both businesses and passengers are improved. Importance of solutions to the new problem is discussed. We also propose a novel design which simulates behaviors of ants in nature to the vehicles. The goal of the system is to obtain an overall balance between the demands of using the services from the passengers and availability of the vehicles in all service areas. The system not only uses historical data to make decisions, it also responds promptly for demands appeared dynamically

SCRAM: A Sharing Considered Route Assignment Mechanism for Fair Taxi Route Recommendations

International audienceRecommending routes for a group of competing taxi drivers is almost untouched in most route recommender systems. For this kind of problem, recommendation fairness and driving efficiency are two fundamental aspects. In the paper, we propose SCRAM, a sharing considered route assignment mechanism for fair taxi route recommendations. SCRAM aims to provide recommendation fairness for a group of competing taxi drivers, without sacrificing driving efficiency. By designing a concise route assignment mechanism, SCRAM achieves better recommendation fairness for competing taxis. By considering the sharing of road sections to avoid unnecessary competition, SCRAM is more efficient in terms of driving cost per customer (DCC). We test SCRAM based on a large number of historical taxi trajectories and validate the recommendation fairness and driving efficiency of SCRAM with extensive evaluations. Experimental results show that SCRAM achieves better recommendation fairness and higher driving efficiency than three compared approaches

Advances in Public Transport Platform for the Development of Sustainability Cities

Modern societies demand high and varied mobility, which in turn requires a complex transport system adapted to social needs that guarantees the movement of people and goods in an economically efficient and safe way, but all are subject to a new environmental rationality and the new logic of the paradigm of sustainability. From this perspective, an efficient and flexible transport system that provides intelligent and sustainable mobility patterns is essential to our economy and our quality of life. The current transport system poses growing and significant challenges for the environment, human health, and sustainability, while current mobility schemes have focused much more on the private vehicle that has conditioned both the lifestyles of citizens and cities, as well as urban and territorial sustainability. Transport has a very considerable weight in the framework of sustainable development due to environmental pressures, associated social and economic effects, and interrelations with other sectors. The continuous growth that this sector has experienced over the last few years and its foreseeable increase, even considering the change in trends due to the current situation of generalized crisis, make the challenge of sustainable transport a strategic priority at local, national, European, and global levels. This Special Issue will pay attention to all those research approaches focused on the relationship between evolution in the area of transport with a high incidence in the environment from the perspective of efficiency

Context-aware mobility analytics and trip planning

The study of user mobility is to understand and analyse the movement of individuals in the spatial and temporal domains. Mobility analytics and trip planning are two vital components of user mobility that facilitate the end users with easy to access navigational support through the urban spaces and beyond. Mobility context describes the situational factors that can influence user mobility decisions. The context-awareness in mobility analytics and trip planning enables a wide range of end users to make effective mobility decisions. With the ubiquity of urban sensing technologies, various situational factors related to user mobility decisions can now be collected at low cost and effort. This huge volume of data collected from heterogeneous data sources can facilitate context-aware mobility analytics and trip planning through intelligent analysis of mobility contexts, mobility context prediction, mobility context representation and integration considering different user perspectives. In each chapter of this thesis such issues are addressed through the development of case-specific solutions and real-world deployments. Mobility analytics include prediction and analysis of many diverse mobility contexts. In this thesis, we present several real-world user mobility scenarios to conduct intelligent contextual analysis leveraging existing statistical methods. The factors related to user mobility decisions are collected and fused from various publicly available open datasets. We also provide future prediction of important mobility contexts which can be utilized for mobility decision making. The performance of context prediction tasks can be affected by the imbalance in context distribution. Another aspect of context prediction is that the knowledge from domain experts can enhance the prediction performance however, it is very difficult to infer and incorporate into mobility analytics applications. We present a number of data-driven solutions aiming to address the imbalanced context distribution and domain knowledge incorporation problems for mobility context prediction. Given an imbalanced dataset, we design and implement a framework for context prediction leveraging existing data mining and sampling techniques. Furthermore, we propose a technique for incorporating domain knowledge in feature weight computation to enhance the task of mobility context prediction. In this thesis, we address key issues related to trip planning. Mobility context inference is a challenging problem in many real-world trip planning scenarios. We introduce a framework that can fuse contextual information captured from heterogeneous data sources to infer mobility contexts. In this work, we utilize public datasets to infer mobility contexts and compute trip plans. We propose graph based context representation and query based adaptation techniques on top of the existing methods to facilitate trip planning tasks. The effectiveness of trip plans relies on the efficient integration of mobility contexts considering different user perspectives. Given a contextual graph, we introduce a framework that can handle multiple user perspectives concurrently to compute and recommend trip plans to the end user. This thesis contains efficient techniques that can be employed in the area of urban mobility especially, context-aware mobility analytics and trip planning. This research is built on top of the existing predictive analytics and trip planning techniques to solve problems of contextual analysis, prediction, context representation and integration in trip planning for real-world scenarios. The contributions of this research enable data-driven decision support for traveling smarter through urban spaces and beyond

Modeling and Optimizing Routing Decisions for Travelers and On-demand Service Providers

This thesis investigates the dynamic routing decisions for individual travelers and on-demand service providers (e.g., regular taxis, Uber, Lyft, etc). For individual travelers, this thesis models and predicts route choice at two time-scales: the day-to-day and within-day. For day-to-day route choice, methodological development and empirical evidences are presented to understand the roles of learning, inertia and real-time travel information on route choices in a highly disrupted network based on data from a laboratory competitive route choice game. The learning of routing policies instead of simple paths is modeled when real-time travel information is available, where a routing policy is defined as a contingency plan that maps realized traffic conditions to path choices. Using data from a competitive laboratory experiment, prediction performance is then measured in terms of both one-step and full trajectory predictions. For within day route choice, a recursive logit model is formulated in a stochastic time-dependent (STD) network without sampling any choice sets. A decomposition algorithm is then proposed so that the model can be estimated in reasonable time. Estimation and prediction results of the proposed model are presented using a data set collected from a subnetwork of Stockholm, Sweden. Taxis and ride-sourcing vehicles play an important role in providing on-demand mobility in an urban transportation system. Unlike individual travelers, they do not have a clear destination when there\u27s no passenger on board. The optimal routing of a vacant taxi is formulated as a Markov Decision Process (MDP) problem to maximize long-term profit over the full working period. Two approaches are proposed to solve the problem. One is the model-based approach where a model of the state transitions of the environment is obtained from queuing-theory based passenger arrival and competing taxi distribution processes. An enhanced value iteration for solving the MDP problem is then proposed making use of efficient matrix operations. The other is the model-free Reinforcement Learning (RL) approach, which learns the best policy directly from observed trajectory data. Both approaches are implemented and tested in a mega city transportation network with reasonable running time, and a systematic comparison of the two approaches is also provided