Rafal Kucharski Lab

selected publications

1. PLOS

   Beyond the dichotomy: How ride-hailing competes with and complements public transport

   Cats, Oded, Kucharski, Rafal, Danda, Santosh Rao, and Yap, Menno

   Plos one 2022

   Abs HTML

   Since ride-hailing has become an important travel alternative in many cities worldwide, a fervent debate is underway on whether it competes with or complements public transport services. We use Uber trip data in six cities in the United States and Europe to identify the most attractive public transport alternative for each ride. We then address the following questions: (i) How does ride-hailing travel time and cost compare to the fastest public transport alternative? (ii) What proportion of ride-hailing trips do not have a viable public transport alternative? (iii) How does ride-hailing change overall service accessibility? (iv) What is the relation between demand share and relative competition between the two alternatives? Our findings suggest that the dichotomy—competing with or complementing—is false. Though the vast majority of ride-hailing trips have a viable public transport alternative, between 20% and 40% of them have no viable public transport alternative. The increased service accessibility attributed to the inclusion of ride-hailing is greater in our US cities than in their European counterparts. Demand split is directly related to the relative competitiveness of travel times i.e. when public transport travel times are competitive ride-hailing demand share is low and vice-versa.

2. CIiT

   Using city-bike stopovers to reveal spatial patterns of urban attractiveness

   Banet, Krystian, Naumov, Vitalii, and Kucharski, Rafał

   Current Issues in Tourism 2022

   Abs HTML

   We demonstrate how digital traces of city-bike trips may become useful to identify urban space attractiveness. We exploit their unique feature – stopovers: short, non-traffic-related stops made by cyclists during their trips. As we demonstrate with the case study of Kraków (Poland), when applied to a big dataset, meaningful patterns appear, with hotspots (places with long and frequent stopovers) identified at both the top tourist and leisure attractions as well as emerging new places. We propose a generic method, applicable to any spatiotemporal city-bike traces, providing results meaningful to understand the general urban space attractiveness and its dynamics. With the proposed filtering (to mitigate a selection bias) and empirical cross-validation (to rule-out false-positive classifications) results effectively reveal spatial patterns of urban attractiveness. Valuable for decision-makers and analysts to enhance understanding of urban space consumption patterns by tourists and residents.

3. SciRep

   Modelling virus spreading in ride-pooling networks

   Kucharski, Rafał, Cats, Oded, and Sienkiewicz, Julian

   Scientific Reports 2021

   Abs HTML

   Urban mobility needs alternative sustainable travel modes to keep our pandemic cities in motion. Ride-pooling, where a single vehicle is shared by more than one traveller, is not only appealing for mobility platforms and their travellers, but also for promoting the sustainability of urban mobility systems. Yet, the potential of ride-pooling rides to serve as a safe and effective alternative given the personal and public health risks considerations associated with the COVID-19 pandemic is hitherto unknown. To answer this, we combine epidemiological and behavioural shareability models to examine spreading among ride-pooling travellers, with an application for Amsterdam. Findings are at first sight devastating, with only few initially infected travellers needed to spread the virus to hundreds of ride-pooling users. Without intervention, ride-pooling system may substantially contribute to virus spreading. Notwithstanding, we identify an effective control measure allowing to halt the spreading before the outbreaks (at 50 instead of 800 infections) without sacrificing the efficiency achieved by pooling. Fixed matches among co-travellers disconnect the otherwise dense contact network, encapsulating the virus in small communities and preventing the outbreaks.

4. TR:B

   Exact matching of attractive shared rides (ExMAS) for system-wide strategic evaluations

   Kucharski, Rafał, and Cats, Oded

   Transportation Research Part B: Methodological 2020

   Abs HTML

   The premise of ride-sharing is that service providers can offer a discount, so that travellers are compensated for prolonged travel times and induced discomfort, while still increasing their revenues. While recently proposed real-time solutions support online operations, algorithms to perform strategic system-wide evaluations are crucially needed. We propose an exact, replicable and demand-, rather than supply-driven algorithm for matching trips into shared rides. We leverage on delimiting our search for attractive shared rides only, which, coupled with a directed shareability multi-graph representation and efficient graph searches with predetermined node sequence, narrows the (otherwise exploding) search-space effectively enough to derive an exact solution. The proposed utility-based formulation paves the way for model integration in travel demand models, allowing for a cross-scenario sensitivity analysis, including pricing strategies and regulation policies. We apply the proposed algorithm in a series of experiments for the case of Amsterdam, where we perform a system-wide analysis of the ride-sharing performance in terms of both algorithm computations of shareability under alternative demand, network and service settings as well as behavioural parameters. In the case of Amsterdam, 3000 travellers offered a 30% discount form 1900 rides achieving an average occupancy of 1.67 and yielding a 30% vehicle-hours reduction at the cost of halving service provider revenues and a 17% increase in passenger-hours. Benchmarking against time-window constrained approaches reveals that our algorithm reduces the search-space more effectively, while yielding solutions that are substantially more attractive for travellers.

5. TR:B

   Simulation of rerouting phenomena in Dynamic Traffic Assignment with the Information Comply Model

   Kucharski, Rafał, and Gentile, Guido

   Transportation Research Part B: Methodological 2019

   Abs HTML

   We present the Information Comply Model (ICM) which extends the framework for macroscopic within-day DTA proposed by Gentile (2016) to represent the rerouting of drivers wrt a single traffic event. Rerouting is reproduced as a two-stage process: first, drivers become aware about the event and its consequences on traffic; second, drivers may decide to change path. At each arc, unaware drivers have a probability of being informed by multiple ATIS sources (radio, VMS, mobile apps), which depends not only on devise penetration rates, but also on users space and time coordinates wrt the position and interval of the event. At each node, aware drivers, who are somehow reluctant to change, may finally modify their path based on a random rerouting utility, which is composed of expected gains and avoided losses. ICM is thus capable of representing the evolution of rerouting phenomena in time and space when the information about a traffic event and its consequences on congestion spread among drivers and onto the network. This way, ICM extends the concept of dynamic user equilibrium to a case of imperfect information related to availability and awareness rather than to individual perception, as well as to a case of bounded rationality with prudent drivers. Besides the model architecture and specification, this paper provides a workable methodology which can be applied both off-line for transport planning and in real-time for traffic management on large size networks.

6. EJOR

   How to split the costs and charge the travellers sharing a ride? Aligning system’s optimum with users’ equilibrium

   Fielbaum, Andres, Kucharski, Rafał, Cats, Oded, and Alonso-Mora, Javier

   European Journal of Operational Research 2021

   Abs HTML

   Emerging on-demand sharing alternatives, in which one resource is utilised simultaneously by a circumstantial group of users, entail several challenges regarding how to coordinate such users. A very relevant case refers to how to form groups in a mobility system that offers shared rides, and how to split the costs within the travellers of a group. These are non-trivial tasks, as two objectives conflict: 1) minimising the total costs of the system, and 2) finding an equilibrium where each user is content with her assignment. Aligning both objectives is challenging, as users are not aware of the externalities induced to the rest. In this paper, we propose protocols to share the costs within a ride so that optimal solutions can also constitute equilibria. To do this, we model the situation as a non-cooperative game, which can be seen as a game-version of the well-known set cover problem. We show that the traditional notions of equilibrium in game theory (Nash and Strong) are not useful here, and prove that determining whether a Strong Equilibrium exists is an NP-Complete problem, by reducing it to the k-Exact-Cover problem. Hence, we propose three alternative equilibrium notions (stronger than Nash and weaker than Strong), depending on how users can coordinate. For each of these equilibrium notions, we propose a (possibly overcharging) cost-sharing protocol that yields the optimal solutions equilibria. Simulations for Amsterdam reveal that our protocols can achieve stable solutions that are close to the optimum, and that having a central coordinator can have a large impact.