QUADRIVEN: A Framework for Qualitative Taxi Demand Prediction Based on Time-Variant Online Social Network Data Analysis

[EN] Road traffic pollution is one of the key factors affecting urban air quality. There is a consensus in the community that the efficient use of public transport is the most effective solution. In that sense, much effort has been made in the data mining discipline to come up with solutions able to anticipate taxi demands in a city. This helps to optimize the trips made by such an important urban means of transport. However, most of the existing solutions in the literature define the taxi demand prediction as a regression problem based on historical taxi records. This causes serious limitations with respect to the required data to operate and the interpretability of the prediction outcome. In this paper, we introduce QUADRIVEN (QUalitative tAxi Demand pRediction based on tIme-Variant onlinE social Network data analysis), a novel approach to deal with the taxi demand prediction problem based on human-generated data widely available on online social networks. The result of the prediction is defined on the basis of categorical labels that allow obtaining a semantically-enriched output. Finally, this proposal was tested with different models in a large urban area, showing quite promising results with an F1 score above 0.8.This work was partially supported by the Fundacion Seneca del Centro de Coordinacion de la Investigacion de la Region de Murcia under Projects 20813/PI/18 and 20530/PDC/18 and by the Spanish Ministry of Science, Innovation and Universities under Grants TIN2016-78799-P (AEI/FEDER, UE) and RTC-2017-6389-5.Terroso-Saenz, F.; Muñoz-Ortega, A.; Cecilia-Canales, JM. (2019). QUADRIVEN: A Framework for Qualitative Taxi Demand Prediction Based on Time-Variant Online Social Network Data Analysis. Sensors. 19(22):1-22. https://doi.org/10.3390/s19224882S1221922Di, Q., Wang, Y., Zanobetti, A., Wang, Y., Koutrakis, P., Choirat, C., … Schwartz, J. D. (2017). Air Pollution and Mortality in the Medicare Population. New England Journal of Medicine, 376(26), 2513-2522. doi:10.1056/nejmoa1702747Li, B., Cai, Z., Jiang, L., Su, S., & Huang, X. (2019). Exploring urban taxi ridership and local associated factors using GPS data and geographically weighted regression. Cities, 87, 68-86. doi:10.1016/j.cities.2018.12.033Yang, Y., Yuan, Z., Fu, X., Wang, Y., & Sun, D. (2019). Optimization Model of Taxi Fleet Size Based on GPS Tracking Data. Sustainability, 11(3), 731. doi:10.3390/su11030731Smith, A. W., Kun, A. L., & Krumm, J. (2017). Predicting taxi pickups in cities. Proceedings of the 2017 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2017 ACM International Symposium on Wearable Computers. doi:10.1145/3123024.3124416Liu, L., Qiu, Z., Li, G., Wang, Q., Ouyang, W., & Lin, L. (2019). Contextualized Spatial–Temporal Network for Taxi Origin-Destination Demand Prediction. IEEE Transactions on Intelligent Transportation Systems, 20(10), 3875-3887. doi:10.1109/tits.2019.2915525Hawelka, B., Sitko, I., Beinat, E., Sobolevsky, S., Kazakopoulos, P., & Ratti, C. (2014). Geo-located Twitter as proxy for global mobility patterns. Cartography and Geographic Information Science, 41(3), 260-271. doi:10.1080/15230406.2014.890072James, N. A., Kejariwal, A., & Matteson, D. S. (2016). Leveraging cloud data to mitigate user experience from ‘breaking bad’. 2016 IEEE International Conference on Big Data (Big Data). doi:10.1109/bigdata.2016.7841013Kuang, L., Yan, X., Tan, X., Li, S., & Yang, X. (2019). Predicting Taxi Demand Based on 3D Convolutional Neural Network and Multi-task Learning. Remote Sensing, 11(11), 1265. doi:10.3390/rs11111265Thomee, B., Shamma, D. A., Friedland, G., Elizalde, B., Ni, K., Poland, D., … Li, L.-J. (2016). YFCC100M. Communications of the ACM, 59(2), 64-73. doi:10.1145/2812802Cho, E., Myers, S. A., & Leskovec, J. (2011). Friendship and mobility. Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD ’11. doi:10.1145/2020408.2020579Estevez, P. A., Tesmer, M., Perez, C. A., & Zurada, J. M. (2009). Normalized Mutual Information Feature Selection. IEEE Transactions on Neural Networks, 20(2), 189-201. doi:10.1109/tnn.2008.2005601Zheng, X., Han, J., & Sun, A. (2018). A Survey of Location Prediction on Twitter. IEEE Transactions on Knowledge and Data Engineering, 30(9), 1652-1671. doi:10.1109/tkde.2018.2807840Assam, R., & Seidl, T. (2014). Context-based location clustering and prediction using conditional random fields. Proceedings of the 13th International Conference on Mobile and Ubiquitous Multimedia - MUM ’14. doi:10.1145/2677972.2677989Genuer, R., Poggi, J.-M., Tuleau-Malot, C., & Villa-Vialaneix, N. (2017). Random Forests for Big Data. Big Data Research, 9, 28-46. doi:10.1016/j.bdr.2017.07.003Tong, Y., Chen, Y., Zhou, Z., Chen, L., Wang, J., Yang, Q., … Lv, W. (2017). The Simpler The Better. Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. doi:10.1145/3097983.3098018Markou, I., Rodrigues, F., & Pereira, F. C. (2018). Real-Time Taxi Demand Prediction using data from the web. 2018 21st International Conference on Intelligent Transportation Systems (ITSC). doi:10.1109/itsc.2018.8569015Zhou, Y., Wu, Y., Wu, J., Chen, L., & Li, J. (2018). Refined Taxi Demand Prediction with ST-Vec. 2018 26th International Conference on Geoinformatics. doi:10.1109/geoinformatics.2018.8557158Moreira-Matias, L., Gama, J., Ferreira, M., Mendes-Moreira, J., & Damas, L. (2013). Predicting Taxi–Passenger Demand Using Streaming Data. IEEE Transactions on Intelligent Transportation Systems, 14(3), 1393-1402. doi:10.1109/tits.2013.2262376Jiang, S., Chen, W., Li, Z., & Yu, H. (2019). Short-Term Demand Prediction Method for Online Car-Hailing Services Based on a Least Squares Support Vector Machine. IEEE Access, 7, 11882-11891. doi:10.1109/access.2019.289182

Metrical service systems with transformations

We consider a generalization of the fundamental online metrical service systems (MSS) problem where the feasible region can be transformed between requests. In this problem, which we call T-MSS, an algorithm maintains a point in a metric space and has to serve a sequence of requests. Each request is a map (transformation) ft : At → Bt between subsets At and Bt of the metric space. To serve it, the algorithm has to go to a point at ∈ At, paying the distance from its previous position. Then, the transformation is applied, modifying the algorithm’s state to ft(at). Such transformations can model, e.g., changes to the environment that are outside of an algorithm’s control, and we therefore do not charge any additional cost to the algorithm when the transformation is applied. The transformations also allow to model requests occurring in the k-taxi problem. We show that for α-Lipschitz transformations, the competitive ratio is Θ(α)n-2 on n-point metrics. Here, the upper bound is achieved by a deterministic algorithm and the lower bound holds even for randomized algorithms. For the k-taxi problem, we prove a competitive ratio of Õ((nlog k)2). For chasing convex bodies, we show that even with contracting transformations no competitive algorithm exists. The problem T-MSS has a striking connection to the following deep mathematical question: Given a finite metric space M, what is the required cardinality of an extension M ⊇ M where each partial isometry on M extends to an automorphism? We give partial answers for special cases

Quantifying the benefits of vehicle pooling with shareability networks

Taxi services are a vital part of urban transportation, and a considerable contributor to traffic congestion and air pollution causing substantial adverse effects on human health. Sharing taxi trips is a possible way of reducing the negative impact of taxi services on cities, but this comes at the expense of passenger discomfort quantifiable in terms of a longer travel time. Due to computational challenges, taxi sharing has traditionally been approached on small scales, such as within airport perimeters, or with dynamical ad-hoc heuristics. However, a mathematical framework for the systematic understanding of the tradeoff between collective benefits of sharing and individual passenger discomfort is lacking. Here we introduce the notion of shareability network which allows us to model the collective benefits of sharing as a function of passenger inconvenience, and to efficiently compute optimal sharing strategies on massive datasets. We apply this framework to a dataset of millions of taxi trips taken in New York City, showing that with increasing but still relatively low passenger discomfort, cumulative trip length can be cut by 40% or more. This benefit comes with reductions in service cost, emissions, and with split fares, hinting towards a wide passenger acceptance of such a shared service. Simulation of a realistic online system demonstrates the feasibility of a shareable taxi service in New York City. Shareability as a function of trip density saturates fast, suggesting effectiveness of the taxi sharing system also in cities with much sparser taxi fleets or when willingness to share is low.Comment: Main text: 6 pages, 3 figures, SI: 24 page

The Merits of Sharing a Ride

The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization approach to match passengers in real-time is the core of any ridesharing system. In this paper, we model ridesharing as an online matching problem on general graphs such that passengers do not drive private cars and use shared taxis. We propose an optimization algorithm to solve it. The outlined algorithm calculates the optimal waiting time when a passenger arrives. This leads to a matching with minimal overall overheads while maximizing the number of partnerships. To evaluate the behavior of our algorithm, we used NYC taxi real-life data set. Results represent a substantial reduction in overall overheads

Towards a Testbed for Dynamic Vehicle Routing Algorithms

Since modern transport services are becoming more flexible, demand-responsive, and energy/cost efficient, there is a growing demand for large-scale microscopic simulation platforms in order to test sophisticated routing algorithms. Such platforms have to simulate in detail, not only the dynamically changing demand and supply of the relevant service, but also traffic flow and other relevant transport services. This paper presents the DVRP extension to the open-source MATSim simulator. The extension is designed to be highly general and customizable to simulate a wide range of dynamic rich vehicle routing problems. The extension allows plugging in of various algorithms that are responsible for continuous re-optimisation of routes in response to changes in the system. The DVRP extension has been used in many research and commercial projects dealing with simulation of electric and autonomous taxis, demand-responsive transport, personal rapid transport, free-floating car sharing and parking search