papers

2023

1. SNAM

   Network structures of urban ride-pooling problems and their properties

   Bujak, Michal, and Kucharski, Rafal

   Social Network Analysis and Mining 2023

   Abs HTML

   Travellers, when sharing their rides in a so-called ride-pooling system, form complex networks. Despite being the algorithmic backbone to the ride-pooling problems, the shareability graphs have not been explicitly analysed yet. Here, we formalise them, study their properties and analyse relations between topological properties and expected ride-pooling performance. We introduce and formalise two representations at the two crucial stages of pooling analysis. On the NYC dataset, we run two simulations with the link generation formulas. One is when we increase discount offered to the travellers for shared rides (our control variable) and observe the phase transition. In the second, we replicate the non-deterministic behaviour of travellers in ride-pooling. This way, we generate probabilistic, weighted networks. We observed a strong correlation between the topological properties of ride-pooling networks and the system performance. Introduced class of networks paves the road to applying the network science methods to a variety of ride-pooling problems, like virus spreading, optimal pricing or stability analysis.

2. RTBM

   Should I stay or should I board? Willingness to wait with real-time crowding information in urban public transport

   Drabicki, Arkadiusz, Cats, Oded, Kucharski, Rafał, Fonzone, Achille, and Szarata, Andrzej

   Research in Transportation Business & Management 2023

   Abs HTML

   Overcrowding is a major phenomenon affecting travel experience in urban public transport, whose negative impacts can be potentially mitigated with real-time crowding information (RTCI) on public transport vehicle departures. In this study, we investigate the willingness to wait (WTW) with instantaneous RTCI to avoid the in-vehicle (over)crowding the passenger faces, focusing specifically on urban crowding context (i.e. bus and tram systems). We conduct a stated-preference survey in Krakow (Poland), where we examine the choice probability between boarding now a more crowded vehicle vs. waiting at the stop for a less-crowded PT departure, and estimate a series of discrete choice models. Results show that 50–70% of respondents consider skipping a first departure which is excessively overcrowded and 10–30% would skip a vehicle with moderate standing crowding on-board. Acceptable waiting times typically range between 2 and 13 min, depending on crowding level and propensity to arrive on-time, but may even exceed 20 min in individual cases. These findings indicate that RTCI can induce a substantial WTW, affecting travel behaviour. We discuss its implications for mitigating service disruptions and demand management policies, including prospective support for public transport recovery in the aftermath of covid-19 crisis.

2022

1. Tmertica:A

   The shareability potential of ride-pooling under alternative spatial demand patterns

   Soza-Parra, Jaime, Kucharski, Rafał, and Cats, Oded

   Transportmetrica A: Transport Science 2022

   Abs HTML

   In this study, we set out to explore how various spatial patterns of travel demand drive the effectiveness of ride-pooling services. To do so, we generate a broad range of synthetic, yet plausible demand patterns. We experiment with the number of attraction centres, the dispersion of destinations around these centres, and the trip length distribution. We apply a strategic ride-pooling algorithm across the generated demand patterns to identify shareability potential using a series of metrics related to ridepooling. Our findings indicate that, under a fixed demand level, vehicle-hour reduction due to ride-pooling can range between 18 and 59%. These results depend on the concentration of travel destinations around the centre and the trip length distribution. Ride-pooling becomes more efficient when trips are longer and destinations are more concentrated. A shift from a monocentric to a polycentric demand pattern is found to have a limited impact on the prospects of ride-pooling..

2. arXiv

   Hyper-pool: pooling private trips into high-occupancy transit-like attractive shared rides

   Kucharski, Rafal, and Cats, Oded

   arXiv preprint arXiv:2206.05940 2022

   HTML
3. arXiv

   Exploring shareability networks of probabilistic ride-pooling problems

   Bujak, Michal, and Kucharski, Rafał

   arXiv preprint arXiv:2206.12259 2022

   HTML
4. arXiv

   Modelling the Rise and Fall of Two-Sided Mobility Markets with Microsimulation

   Ghasemi, Farnoud, and Kucharski, Rafał

   arXiv preprint arXiv:2208.02496 2022

   HTML
5. PLOS

   Simulating two-sided mobility platforms with MaaSSim

   Kucharski, Rafał, and Cats, Oded

   PLoS ONE 2022

   Abs HTML

   Two-sided mobility platforms, such as Uber and Lyft, widely emerged in the urban mobility landscape. Distributed supply of individual drivers, matched with travellers via intermediate platform yields a new class of phenomena not present in urban mobility before. Such disruptive changes to transportation systems call for a simulation framework where researchers from various and across disciplines may introduce models aimed at representing the complex dynamics of platform-driven urban mobility. In this work, we present MaaSSim, a lightweight agent-based simulator reproducing the transport system used by two kinds of agents: (i) travellers, requesting to travel from their origin to destination at a given time, and (ii) drivers supplying their travel needs by offering them rides. An intermediate agent, the platform, matches demand with supply. Agents are individual decision-makers. Specifically, travellers may decide which mode they use or reject an incoming offer; drivers may opt-out from the system or reject incoming requests. All of the above behaviours are modelled through user-defined modules, allowing to represent agents’ taste variations (heterogeneity), their previous experiences (learning) and available information (system control). MaaSSim is a flexible open-source python library capable of realistically reproducing complex interactions between agents of a two-sided mobility platform. MaaSSim is available from a public repository, along with a set of tutorials and reproducible use-case scenarios, as demonstrated with a series of illustrative examples and a comprehensive case study.

6. Transportation

   Mitigating bus bunching with real-time crowding information

   Drabicki, Arkadiusz, Kucharski, Rafał, and Cats, Oded

   Transportation 2022

   Abs HTML

   A common problem in public transport systems is bus bunching, characterized by a negative feedback loop between service headways, number of boarding passengers and dwell times. In this study, we examine whether providing real-time crowding information (RTCI) at the stop regarding the two next vehicle departures can stimulate passengers to wait for a less-crowded departure, and thus alleviate the bunching effect. To this end, we leverage on results from own stated-preference survey and develop a boarding choice model. The model accounts for the presence of RTCI and is implemented within dynamic public transport simulation framework. Application to the case-study model of a major bus corridor in Warsaw (Poland) reveals that RTCI can induce a significant probability (30–70%) of intentionally skipping an overcrowded bus and waiting for a later departure instead. This behaviour, in turn, results in significantly lower vehicle headway and load variations, without deteriorations in total waiting utility. Overall, journey experience improves by 6%, and crucially—the prevalence of denial-of-boarding and excessive on-board overcrowding is substantially reduced, by ca. 40%. Results of our study indicate that the willingness to wait induced by RTCI can be a potential demand management strategy in counteracting bunching, with benefits already attainable at limited RTCI response rates.

7. Tmetrica:B

   Evolution of labour supply in ridesourcing

   Ruijter, Arjan, Cats, Oded, Kucharski, Rafal, and Lint, Hans

   Transportmetrica B: Transport Dynamics 2022

   Abs HTML

   Contrary to traditional transit services, supply in ridesourcing systems emerges from individual labour decisions of gig workers. The effect of decentralisation in supply on the evolution of on-demand transit services is largely unknown. To this end, we propose a dynamic model comprising of the subsequent supply-side processes: (i) initial exposure to information about the platform, (ii) a long-term registration decision, and (iii) daily participation decisions, subject to day-to-day learning based on within-day matching outcomes. We construct a series of experiments to study the effect of supply market properties and pricing strategies. We find that labour supply in ridesourcing may be non-linear and undergo several transitions, inducing significant variations in income levels and level of service over time. Our results provide indications that the ridesourcing market may benefit from a cap in supply and regulation of the commission fee.

8. 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.

9. 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.

2021

1. 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.

2. Tmetrica:A

   If you are late, everyone is late: late passenger arrival and ride-pooling systems’ performance

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

   Transportmetrica A: Transport Science 2021

   Abs HTML

   Sharing rides in on-demand systems allow passengers to reduce their fares and service providers to increase revenue, though at the cost of adding uncertainty to the system. Notably, the uncertainty of ride-pooling systems stems not only from travel times but also from unique features of sharing, such as the dependency on other passengers’ arrival time at their pick up points. In this work, we theoretically and experimentally analyse how late arrivals at pick up locations impact shared rides’ performance. We find that the total delay is equally distributed among sharing passengers. However, delay composition gradually shifts from on-board delay only for the first passenger to waiting delay at the origin for the last passenger. Sadly, trips with more passengers are more adversely impacted. Strategic behaviour analysis reveals Nash equilibria that might emerge. We analyse the system-wide effects and find that when lateness increases passengers refrain from sharing and eventually opt-out.

3. Tmetrica:A

   Modelling the effects of real-time crowding information in urban public transport systems

   Drabicki, Arkadiusz, Kucharski, Rafał, Cats, Oded, and Szarata, Andrzej

   Transportmetrica A: Transport Science 2021

   Abs HTML

   Public transport (PT) overcrowding is a notorious problem in urban transport networks. Its negative effects upon travel experience can be potentially addressed by disseminating real-time crowding information (RTCI) to passengers. However, impacts of RTCI provision in urban PT networks remain largely unknown. This study aims to contribute by developing an extended dynamic PT simulation model that enables a thorough analysis of instantaneous RTCI consequences. In the model, RTCI is generated and disseminated across the network, and then utilised in passengers’ sequential en-route choices. A case-study demonstration of the RTCI algorithm on urban PT network model of Kraków (Poland) shows that instantaneous RTCI has the potential to improve passengers’ travel experience, although it is also susceptible to inaccuracy. RTCI provision can yield total travel utility improvements of 3% in typical PM peak-hour, with reduced impacts of the worst overcrowding effects (in terms of denied-boarding and in-vehicle travel disutility in overcrowded conditions) of 30%.

4. 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.

2020

1. 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.

2. TRR

   Low-Dimensional Model for Bike-Sharing Demand Forecasting that Explicitly Accounts for Weather Data

   Cantelmo, Guido, Kucharski, Rafał, and Antoniou, Constantinos

   Transportation Research Record 2020

   Abs HTML

   With the increasing availability of big, transport-related datasets, detailed data-driven mobility analysis is becoming possible. Trips with their origins, destinations, and travel times are now collected in publicly available databases, allowing for detailed demand forecasting with methods exploiting big and accurate data. In this paper, we predict the demand pattern of New York City bikes with a low-dimensional approach utilizing three-level data clustering. We use historical demand data along with temperature and precipitation to first aggregate and then decompose data to obtain meaningful clusters. The core of this approach lies in the proposed clustering technique, which reduces the dimension of the problem and, differently from other machine learning techniques, requires limited assumptions on the model or its parameters. The proposed method allows, for the given temperature and precipitation method, to obtain expected vector of movement (mean number and direction of trips) for each zone. In this paper, we synthesize more than 17 million trips into daily and zonal vectors of movement, which combined with weather data allow forecasting of the trip demand. The method allows us to predict the demand with over 75% accuracy, as shown in series of experiments in which various settings and parameterizations are validated against 25% holdout data.

3. JAT

   Lewis–Mogridge Points: A Nonarbitrary Method to Include Induced Traffic in Cost-Benefit Analyses

   Kucharski, Rafał, Drabicki, Arkadiusz, Paszkowski, Jan, and Szarata, Andrzej

   Journal of Advanced Transportation 2020

   Abs HTML

   We propose a new method to estimate benefits of road network improvements, which allows to include the induced demand without arbitrary assumptions. Instead of estimating induced demand (which is nontrivial and hardly possible in practice), we search for demand induction where initial benefits are mitigated to zero. Such approach allows to formulate a dual measure of benefit, covering both the potential benefits and the likelihood of consuming them by the induced traffic. We first estimate benefits of road network improvement assuming that traffic demand is fixed. Consequently, we find demand model configurations at which the benefits of the new investment become null, i.e., all the initial benefits are consumed by the traffic demand growth. We call such states of induced demand the Lewis–Mogridge points of the analysed improvement. We ct the most probable of such points and use it to calculate the proposed novel indicator μ, for which the initial benefits (obtained under a fixed-demand assumption) are multiplied with a demand increase rate needed to consume them. We believe that such measure allows to include the critical phenomena of induced traffic and, at the same time, to overcome problems associated with reliable estimation of induced demand. As we illustrate with the case of two alternative road improvement schemes in Kraków, Poland, the proposed method allows to estimate maximal threshold of induced traffic and to select scenario more resilient to induced traffic.

2019

1. TR:D

   Impact of commuting, time budgets, and activity durations on modal disparity in accessibility to supermarkets

   Niedzielski, Michał A., and Kucharski, Rafał

   Transportation Research Part D: Transport and Environment 2019

   Abs HTML

   Urban spatial structure, transport mode and space-time constraints are known to affect accessibility to activities for a city’s residents. However, most studies measure accessibility from home only and report accessibility in terms of the travel time or number of activities. Such studies neglect the mobility and time budget constraints on people’s accessibility. Furthermore, modal accessibility disparity studies have not considered inequality between modes during the afternoon commute. We examine accessibility to non-work activities by automobile and public transport using spatiotemporal measures that determine the number of minutes people have available to participate in activities, given time budget and activity duration constraints, rather than simply the number of activities. We examine modal accessibility disparity in Warsaw, Poland. Our two major findings are the reverse of findings in previous studies: that disparity shifts toward public transport as the activity duration increases and the travel time decreases; and that it shifts toward public transport with increasing distance away from the city center.

2. 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.

3. EJTIR

   Multichannel queueing behaviour in urban bicycle traffic

   Kucharski, Rafał, Drabicki, Arkadiusz, Żyłka, Klaudia, and Szarata, Andrzej

   European Journal of Transport and Infrastructure Research 2019

   Abs HTML

   The objective of this paper is to propose a method to analyse and describe cyclists’ behaviour at signalized intersections with specific focus on the multichannel (multi-lane) queue phenomenon. As we observed, cyclists form queues without a fixed-lane and FIFO discipline, for which the classical, car-oriented analytical approach becomes insufficient. Cyclists’ multichannel queueing behaviour is common and characterized by substantial degree of variability, especially in case of shorter queues which emerge regularly at cycle crossings. Although cyclist behaviour has been widely studied by transportation research community, their queueing behaviour picture is still incomplete. Namely, there is no method addressed to analyse the full scope of these phenomena and to quantify their impact on the cyclist queue performance. To bridge this gap, we introduce the technique to observe multichannel queues and report relevant observations, which we then complement with a methodological framework to analyse obtained results and provide a complete multichannel queue description. We video-record cyclists as they enqueue to one of multiple channels, form the queue and smoothly merge into a single lane again as the queue discharges. We apply the method to analyse results from a pilot study of 160 cyclists forming 50 queues in the city of Krakow, Poland. The proposed method allows us to analyse and quantify the observed queue performance and its characteristics: the number of channels, their emergence process, channel and queue lengths, discharge process with FIFO violations, starting and discharging times. Findings from pilot study reveal that both queue length and discharge times strongly depend on queue formation process. The contribution of this paper is the method to describe multichannel cyclist queueing behaviour, enriching current picture of bicycle flow and cyclists’ behaviour. Since the method has been developed on relatively short queues (up to 10 cyclists), findings included in this paper primarily refer to such queue sizes. Nonetheless, the method is formulated in a generic way, applicable also for longer bicycle queues. Possible practical implications are new estimates for queue lengths and discharge times - useful for bicycle infrastructure design and traffic engineering purposes.

2017

1. JAT

   Estimating Macroscopic Volume Delay Functions with the Traffic Density Derived from Measured Speeds and Flows

   Kucharski, Rafał, and Drabicki, Arkadiusz

   Journal of Advanced Transportation 2017

   Abs HTML

   This paper proposes a new method to estimate the macroscopic volume delay function (VDF) from the point speed-flow measures. Contrary to typical VDF estimation methods it allows estimating speeds also for hypercritical traffic conditions, when both speeds and flow drop due to congestion (high density of traffic flow). We employ the well-known hydrodynamic relation of fundamental diagram to derive the so-called quasi-density from measured time-mean speeds and flows. This allows formulating the VDF estimation problem with a speed being monotonically decreasing function of quasi-density with a shape resembling the typical VDF like BPR. This way we can use the actually observed speeds and propose the macroscopic VDF realistically reproducing actual speeds also for hypercritical conditions. The proposed method is illustrated with half-year measurements from the induction loop system in city of Warsaw, which measured traffic flows and instantaneous speeds of over 5 million vehicles. Although the proposed method does not overcome the fundamental limitations of static macroscopic traffic models, which cannot represent dynamic traffic phenomena like queue, spillback, wave propagation, capacity drop, and so forth, we managed to improve the VDF goodness-of-fit from of 27% to 72% most importantly also for hypercritical conditions. Thanks to this traffic congestion in macroscopic traffic models can be reproduced more realistically in line with empirical observations.