SearcharxivSearch

arXiv subjects

Oded Cats

Publications and source records attributed to Oded Cats.

At least 19 recordsLinked to original sources

Weighted complement graphs of spatial networks with functional connections reveal nodes with high potential for new links

In this study, we take a systematic look at the unrealised part of public transport networks (PTNs) with functional connections. We consider their complement graphs and study their structure. The complement graph $\bar G$ of an unweighted graph $G$ is a straightforward concept, yielding a graph on the same set of nodes, and an edge exists in $\bar G$ if and only if it is not present in $G$. In contrast, a weighted complement graph cannot be uniquely determined. However, if we consider PTNs with travel times as edge weights, there are physical constraints on the possible weight ranges. We propose a method to construct weighted complement graphs of operational PTN graph representations based on the geographical distances between nodes (representing stops) and assign weights to edges based on distance, combined with network-specific distributions of effective velocities and waiting times. We observe that the most central nodes in the weighted complement graph do not correspond to the least central nodes in the original network but are, remarkably, those in the geographical centre of the network that lack topological connectedness. Testing against null models on a dataset of 31 metro networks worldwide confirms that this is a fundamentally spatial effect.

physics.soc-ph

Multilayer public transport networks

The introduction of network science approaches into public transport research has seen great advances in the past 15 years. However, it has become apparent that monolayer networks are often not sufficient to model and analyse real-world systems in sufficient detail. In the last decade, the theory of multilayer networks has proven to be an invaluable tool in various disciplines, including transport. Multilayer networks consist of layers of networks that are coupled among themselves. This enables modelling of complex systems with heterogeneous elements and relations between them. Although there is a body of work in public transport research that uses multilayer networks, the related literature is scattered, lacking unified terminology and agreed-upon approaches. We posit that there is vast uncovered potential in using multilayer network approaches to public transport modelling, planning, and operations. We first present the basic formalisms of multilayer networks with a focus on how they (may) relate to public transport networks. We then provide a systematic review of the literature on multilayer networks in public transport research. We identify and taxonomise ways in which public transport systems are modelled as multilayer networks. Based on the survey and drawing from the state and history of network science in public transport research as well as multilayer approaches across other application domains, we propose a research agenda for multilayer public transport networks for the upcoming decade(s).

physics.soc-ph

T-STAR: A Context-Aware Transformer Framework for Short-Term Probabilistic Demand Forecasting in Dock-Based Shared Micro-Mobility

Reliable short-term demand forecasting is essential for managing shared micro-mobility services and ensuring responsive, user-centered operations. This study introduces T-STAR (Two-stage Spatial and Temporal Adaptive contextual Representation), a novel transformer-based probabilistic framework designed to forecast station-level bike-sharing demand at a 15-minute resolution. T-STAR addresses key challenges in high-resolution forecasting by disentangling consistent demand patterns from short-term fluctuations through a hierarchical two-stage structure. The first stage captures coarse-grained hourly demand patterns, while the second stage improves prediction accuracy by incorporating high-frequency, localized inputs, including recent fluctuations and real-time demand variations in connected metro services, to account for temporal shifts in short-term demand. Time series transformer models are employed in both stages to generate probabilistic predictions. Extensive experiments using Washington D.C.'s Capital Bikeshare data demonstrate that T-STAR outperforms existing methods in both deterministic and probabilistic accuracy. The model exhibits strong spatial and temporal robustness across stations and time periods. A zero-shot forecasting experiment further highlights T-STAR's ability to transfer to previously unseen service areas without retraining. These results underscore the framework's potential to deliver granular, reliable, and uncertainty-aware short-term demand forecasts, which enable seamless integration to support multimodal trip planning for travelers and enhance real-time operations in shared micro-mobility services.

cs.LG

Demand-side decarbonisation at scale via MaaS-integrated carbon incentives

Digital carbon incentives are increasingly used to promote low-carbon travel, but city-scale evidence on their behavioral and carbon-accounting implications remains limited. We evaluated a carbon-incentive program on a Beijing Mobility-as-a-Service platform using 4.82 billion trips from 2.96 million users over 13 months, with a matched panel of enrolled and non-enrolled users. Enrollment was associated with a 20.3 percentage-point increase in the monthly low-carbon travel share, with pre-enrollment trends remaining near zero across event-study tests. A random-forest accounting scenario trained on pre-enrollment data implied a 1.8% citywide decline in gasoline-car trips and annual reductions of 94,353 tonnes of CO2, equivalent to 5.7% of the certified reductions traded in Beijing's carbon market in 2023. This estimate is model-dependent rather than a directly observed or causally identified program effect. Larger program-associated responses were concentrated in areas with greater transit access. These results show that carbon-market-financed digital incentives can support measurable low-carbon travel responses at the city scale.

stat.AP

Regulating Ride-Sourcing Markets: Can Minimum Wage Regulation Protect Drivers Without Disrupting the Market?

Ride-sourcing platforms such as Uber and Lyft are prime examples of the gig economy, recruiting drivers as independent contractors, thereby avoiding legal and fiscal obligations. Although platforms offer flexibility in choosing work shifts and areas, many drivers experience low income and poor working conditions, leading to widespread strikes and protests. Minimum wage regulation is adopted to improve drivers welfare. However, the impacts of this regulation on drivers as well as on travelers and platforms, remain largely unknown. While ride-sourcing platforms do not disclose the relevant data, state-of-the-art models fail to explain the effects of minimum wage regulation on market dynamics. In this study, we assess the effectiveness and implications of minimum wage regulation in ride-sourcing markets while simulating the detailed dynamics of ride-sourcing markets under varying regulation intensities, both with and without the so-called platform lockout strategy. Our findings reveal that minimum wage regulation impacts substantially drivers income, and may lead to higher fares for travelers and threaten platforms survival. When platforms adopt a lockout strategy, their profitability significantly improves and drivers earn more, although many others lose their jobs, and service level for travelers consequently declines.

cs.ET

Access graph: a novel graph representation of public transport networks for accessibility analysis

Accessibility, defined as travel impedance between spatially dispersed opportunities for activity, is one of the main determinants of public transport use. In-depth understanding of its properties is crucial for optimal public transport systems planning and design. Although the concept has been around for decades and there is a large body of literature on accessibility operationalisation and measurement, a unified approach is lacking. To this end, we introduce a novel graph representation of public transport networks, termed the Access Graph, or A-space, based on the generalised travel times between nodes. We introduce an edge between two nodes in the access graph if the travel time between them is below a certain threshold time budget. In this representation, node degree directly measures the number of nodes reachable within a predetermined time, reproducing the cumulative opportunities measure of access at each specific value of the time budget. We study the threshold-dependent degree distribution of the access graph, focusing on the average degree and the changes in distributions between consecutive time steps. We define a set of accessibility indicators, as well as access equity indicators. The indicators are observed at two characteristic times; the first is based on the evolution of access graph topology and pertaining to the point of degree saturation, reflecting system performance, and the second from the passengers' perspective. We apply the methodology to a dataset of 51 metro networks worldwide. The new representation addresses accessibility at the network structure level, offering a conceptual framework for unified accessibility studies.

physics.soc-ph

Learning Personalized Utility Functions for Drivers in Ride-hailing Systems Using Ensemble Hypernetworks

In ride-hailing systems, drivers decide whether to accept or reject ride requests based on factors such as order characteristics, traffic conditions, and personal preferences. Accurately predicting these decisions is essential for improving the efficiency and reliability of these systems. Traditional models, such as the Random Utility Maximization (RUM) approach, typically predict drivers' decisions by assuming linear correlations among attributes. However, these models often fall short because they fail to account for non-linear interactions between attributes and do not cater to the unique, personalized preferences of individual drivers. In this paper, we develop a method for learning personalized utility functions using hypernetwork and ensemble learning. Hypernetworks dynamically generate weights for a linear utility function based on trip request data and driver profiles, capturing the non-linear relationships. An ensemble of hypernetworks trained on different data segments further improve model adaptability and generalization by introducing controlled randomness, thereby reducing over-fitting. We validate the performance of our ensemble hypernetworks model in terms of prediction accuracy and uncertainty estimation in a real-world dataset. The results demonstrate that our approach not only accurately predicts each driver's utility but also effectively balances the needs for explainability and uncertainty quantification. Additionally, our model serves as a powerful tool for revealing the personalized preferences of different drivers, clearly illustrating which attributes largely impact their rider acceptance decisions.

cs.LG

Timing the Match: A Deep Reinforcement Learning Approach for Ride-Hailing and Ride-Pooling Services

Efficient timing in ride-matching is crucial for improving the performance of ride-hailing and ride-pooling services, as it determines the number of drivers and passengers considered in each matching process. Traditional batched matching methods often use fixed time intervals to accumulate ride requests before assigning matches. While this approach increases the number of available drivers and passengers for matching, it fails to adapt to real-time supply-demand fluctuations, often leading to longer passenger wait times and driver idle periods. To address this limitation, we propose an adaptive ride-matching strategy using deep reinforcement learning (RL) to dynamically determine when to perform matches based on real-time system conditions. Unlike fixed-interval approaches, our method continuously evaluates system states and executes matching at moments that minimize total passenger wait time. Additionally, we incorporate a potential-based reward shaping (PBRS) mechanism to mitigate sparse rewards, accelerating RL training and improving decision quality. Extensive empirical evaluations using a realistic simulator trained on real-world data demonstrate that our approach outperforms fixed-interval matching strategies, significantly reducing passenger waiting times and detour delays, thereby enhancing the overall efficiency of ride-hailing and ride-pooling systems.

cs.LG

Dynamic Preference-based Multi-modal Trip Planning of Public Transport and Shared Mobility

The shift from private vehicles to public and shared transport is crucial to reducing emissions and meeting climate targets. Consequently, there is an urgent need to develop a multimodal transport trip planning approach that integrates public transport and shared mobility solutions, offering viable alternatives to private vehicle use. To this end, we propose a preference-based optimization framework for multi-modal trip planning with public transport, ride-pooling services, and shared micro-mobility fleets. We introduce a mixed-integer programming model that incorporates preferences into the objective function of the mathematical model. We present a meta-heuristic framework that incorporates a customized Adaptive Large Neighborhood Search algorithm and other tailored algorithms, to effectively manage dynamic requests through a rolling horizon approach. Numerical experiments are conducted using real transport network data in a suburban area of Rotterdam, the Netherlands. Model application results demonstrate that the proposed algorithm can efficiently obtain near-optimal solutions. Managerial insights are gained from comprehensive experiments that consider various passenger segments, costs of micro-mobility vehicles, and availability fluctuation of shared mobility.

math.OC

COVID-19 risk-perception in long-distance travel

Long-distance travel has seen little attention in the past, largely due its sporadic nature. A single long-distance trip can amount to a distance equivalent to a year's worth of commute trips, resulting in a similar, if not worse, environmental footprint. Understanding travellers' behaviour is thus just as relevant for such trips. As international travel is slowly picking up from the COVID-19 pandemic, it has been marred by an abundance of national and regional pandemic-related safety measures. While their primary goal is to protect the local population from infection, these safety may also make travellers feel safer while travelling. This perceived safety can - and likely does - differ from the true efficacy of the measures. In this research, we investigate people's perception of eight COVID-19-related safety measures related to long-distance trips and how subjective perception of safety impacts their mode choice among car, train and aircraft. We employ a Hierarchical Information Integration (HII) approach to capture subjective perceptions and then model the obtained data by means of a Latent Class Choice Model, resulting in four distinct segments. To extrapolate the segments onto the rating experiment of HII, we apply a weighted least squares (WLS) regression, to obtain segment-specific safety perception. Two segments show a relatively high value-of-time (72EUR/h and 50EUR/h), tend to be more mode-agnostic and prefer determining the level of risk by themselves (relying primarily on infection and vaccination rate). The remaining two segments have a lower value-of-time (38EUR / h and 15EUR/h) and have strong mode affinity, for the train and car respectively. Future research could look into a way that segments the sample based on both the mode choice and rating experiment, providing additional insights into the heterogeneity of individuals in their perceptions.

physics.soc-ph

An instance-based learning approach for evaluating the perception of ride-hailing waiting time variability

Understanding user's perception of service variability is essential to discern their overall perception of any type of (transport) service. We study the perception of waiting time variability for ride-hailing services. We carried out a stated preference survey in August 2021, yielding 936 valid responses. The respondents were faced with static pre-trip information on the expected waiting time, followed by the actually experienced waiting time for their selected alternative. We analyse this data by means of an instance-based learning (IBL) approach to evaluate how individuals respond to service performance variation and how this impacts their future decisions. Different novel specifications of memory fading, captured by the IBL approach, are tested to uncover which describes the user behaviour best. Additionally, existing and new specification of inertia (habit) are tested. Our model outcomes reveal that the perception of unexpected waiting time is within the expected range of 2-3 times the value-of-time. Travellers seem to place a higher reward on an early departure compared to a penalty for a late departure of equal magnitude. A cancelled service, after having made a booking, results in significant disutility for the passenger and a strong motivation to shift to a different provider. Considering memory decay, our results show that the most recent experience is by far the most relevant for the next decision, with memories fading quickly in importance. The role of inertia seems to gain importance with each additional consecutive choice for the same option, but then resetting back to zero following a shift in behaviour.

physics.soc-ph

An adaptive route choice model for integrated fixed and flexible transit systems

Over the past decade, there has been a surge of interest in the transport community in the application of agent-based simulation models to evaluate flexible transit solutions characterized by different degrees of short-term flexibility in routing and scheduling. A central modeling decision in the development of an agent-based simulation model for the evaluation of flexible transit is how one chooses to represent the mode- and route-choices of travelers. The real-time adaptive behavior of travelers is intuitively important to model in the presence of a flexible transit service, where the routing and scheduling of vehicles is highly dependent on supply-demand dynamics at a closer to real-time temporal resolution. We propose a utility-based transit route-choice model with representation of within-day adaptive travel behavior and between-day learning where station-based fixed-transit, flexible-transit, and active-mode alternatives may be dynamically combined in a single path. To enable experimentation, this route-choice model is implemented within an agent-based dynamic public transit simulation framework. Model properties are first explored in a choice between fixed- and flexible-transit modes for a toy network. The framework is then applied to illustrate level-of-service trade-offs and analyze traveler mode choices within a mixed fixed- and flexible transit system in a case study based on a real-life branched transit service in Stockholm, Sweden.

cs.MA

Multi-purpose Pickup and Delivery Problem for Combined Passenger and Freight Transport

Recent developments in modular transport vehicles allow deploying multi-purpose vehicles which can alternately transport different kinds of flows. In this study, we propose a novel variant of the pickup and delivery problem, the multi-purpose pickup and delivery problem, where multi-purpose vehicles are assigned to serve a multi-commodity flow. We solve a series of use case scenarios using an exact optimization algorithm and an adaptive large neighborhood search algorithm. We compare the performance of a multi-purpose vehicle fleet to a mixed single-use vehicle fleet. Our findings suggest that total costs can be reduced by an average of 13% when multi-purpose vehicles are deployed, while at the same time reducing the total vehicle trip duration and total distance travelled by an average of 33% and 16%, respectively. The size of the fleet can be reduced by an average of 35%. The results can be used by practitioners and policymakers to decide on whether the combination of passenger and freight demand flows with multi-purpose vehicles in a given system will yield benefits compared to existing fleet configurations.

math.OC

Modular Vehicle Routing for Combined Passenger and Freight Transport

The continuous increase in urban deliveries and the ongoing urbanization of large cities require the development of efficient and sustainable transportation solutions. This study investigates the impact of modular vehicle concepts and the consolidation of different demand types in the route planning on the efficiency of the urban freight and passenger transportation system. Modularity is achieved by connecting multiple vehicles together to form a platoon. The consolidation of different demand types is realized by simultaneously consider passenger and freight demand in the optimization algorithm. The considered vehicles are specific for each demand type by can be connected freely, hence it is possible to transport different demand types in the same platoon. The cost terms in the problem formulation are comprised of travel time costs, travel distance costs, fleet size costs, and cost considering unserved requests. The modular vehicle operations are modeled in a novel pickup and delivery problem which is solved using CPLEX and Adaptive Large Neighborhood Search. In an extensive scenario study and case study in Stockholm, the potentials of the new modular vehicle type are explored for different spatial and temporal demand distributions. A parameter study on vehicle capacity, vehicle range and cost saving assumptions is performed to study their influence on the efficiency. The experiments carried out indicate a general cost savings of 48% due to modularity and an additional 9% due to consolidation. The reduction mainly stems from reduced operating costs and reduced trip duration, while the same number of requests can be served in all cases. Empty vehicle kilometers are reduced by more than 60% by consolidation and modularity. The proposed model and optimization framework can be used by companies and policy makers to identify required fleet sizes, optimal vehicle routes and cost savings.

math.OC

Identifying Human Mobility Patterns using Smart Card Data

Human mobility is subject to collective dynamics that are the outcome of numerous individual choices. Smart card data which originated as a means of facilitating automated fare collections has emerged as an invaluable source for analyzing human mobility patterns. A variety of clustering and segmentation techniques has been adopted and adapted for applications ranging from passenger demand market segmentation to the analysis of urban activity locations. In this paper we provide a systematic review of the state-of-the-art on clustering public transport users based on their temporal or spatial-temporal characteristics as well as studies that use the patter to characterize individual stations, lines or urban areas. Furthermore, a critical review of the literature reveals an important distinction between studies focusing on the intra-personal variability of travel patterns versus those concerned with the inter-personal variability of travel patterns. We synthesize the key analysis approaches and based on which identify and outline the following directions for further research: (i) predictions of passenger travel patterns; (ii) decision support for service planning and policy evaluation; (iii) enhanced geographical characterization of users' travel patterns; (iv) from demand analytics towards behavioral analytics.

physics.soc-ph

Analysis and Prediction of Ridership Impacts during Planned Public Transport Disruptions

Urban metro and tram networks are regularly subject to planned disruptions, including closures, resulting from the need to maintain and renew infrastructure. In this study, we first empirically analyse the passenger demand response to planned public transport disruptions based on individual passenger travel behaviour, based on which we infer generalised journey time and cost elasticities for different passenger groups and time periods of the day. Second, we develop a model which enables predicting public transport demand for individual origin-destination pairs affected by a closure. The model is trained based on the empirically observed travel behaviour. The proposed method is applied to a case study closure in Amsterdam, the Netherlands, based on which we empirically derive generalised journey time and generalised journey cost elasticities. Our results suggest that passengers demand response is lower for frequent users of the public transport network, as well as during weekdays, especially during the peak periods. Arguably, this stems from a higher share of captive passengers with a mandatory journey purpose in these segments, who will continue making their journey nevertheless. During weekends, with typically higher shares of leisure related journeys, a much more pronounced demand response is found. The estimated neural network regression model is able to predict passenger demand during public transport closures with a high level of accuracy. This provides public transport agencies more precise insights into the impact of closures on their revenue losses and on the potential need for resources reallocation.

physics.soc-ph

On the Relocation Behaviour of Ride-sourcing Drivers

Ride-sourcing drivers as individual service suppliers can freely adopt their own relocation strategies including waiting, cruising freely, or following the platform recommendations. These decisions substantially impact the balance between supply and demand, and consequently affect system performance. We conducted a stated choice experiment to study the searching behaviour of ride-sourcing drivers and examine novel policies. A unique dataset of 576 ride-sourcing drivers working in the US was collected and a choice modelling approach was used to estimate the effects of multiple existing and hypothetical attributes. The results suggest that relocation strategies of ride-sourcing drivers considerably vary between different groups of drivers. Surge pricing significantly stimulates drivers to head towards the designated areas. However, the distance between the location of drivers and surge or high-demand areas demotivates them to follow the platform repositioning recommendations. We discuss the implications of our findings for various platform policies on real-time information sharing and platform repositioning guidance.

physics.soc-ph

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

We propose Hyper-pool, an analytical, offline, utility-driven ride-pooling algorithm to aggregate individual trip requests into attractive shared rides of high-occupancy. We depart from our ride-pooling ExMAS algorithm where single rides are pooled into attractive door-to-door rides and propose two novel demand-side algorithms for further aggregating individual demand towards more compact pooling. First, we generate stop-to-stop rides, with a single pick up and drop off points optimal for all the travellers. Second, we bundle such rides again, resulting with hyper-pooled rides compact enough to resemble public transport operations. We propose a bottom-up framework where the pooling degree of identified rides is gradually increased, thereby ensuring attractiveness at subsequent aggregation levels. Our Hyper-pool method outputs the set of attractive pooled rides per service variant for a given travel demand. The algorithms are publicly available and reproducible. It is applicable for real-size demand datasets and opens new opportunities for exploiting the limits of ride-pooling potential. In our Amsterdam case-study we managed to pool over 220 travellers into 40 hyper-pooled rides of average occupancy 5.8 pax/veh.

physics.soc-ph