Modeling and Prediction of Ride-Sharing Utilization Dynamics
Bibliographic record
Abstract
The potential of an efficient ride-sharing scheme to significantly reduce traffic congestion, lower emission level, and drivers’ stress, as well as facilitating the introduction of smart cities has been widely demonstrated in recent years. Furthermore, ride sharing can be implemented within a sound economic regime through the involvement of commercial services that creates a win-win for all parties (e.g., Uber , Lyft or Sidecar ). This positive thrust however is faced with several delaying factors, one of which is the volatility and unpredictability of the potential benefit (or utilization) of ride-sharing at different times, and in different places. Better understanding of ride-sharing dynamics can help policy makers and urban planners in increase the city’s “ride-sharing friendliness” either by designing new ride-sharing oriented systems, as well as by providing ride-sharing service operators better tools to optimize their services. In this work the following research questions are posed: (a) Is ride-sharing utilization stable over time or does it undergo significant changes? (b) If ride-sharing utilization is dynamic can it be correlated with some traceable features of the traffic? and (c) If ride-sharing utilization is dynamic can it be predicted ahead of time? We analyze a dataset of over 14 million taxi trips taken in New York City. We propose a dynamic travel network approach for modeling and forecasting the potential ride-sharing utilization over time, showing it to be highly volatile. In order to model the utilization's dynamics, we propose a network-centric approach, projecting the aggregated traffic taken from continuous time periods into a feature space comprised of topological features of the network implied by this traffic. This feature space is then used to model the dynamics of ride-sharing utilization over time. The results of our analysis demonstrate the significant volatility of ride-sharing utilization over time, indicating that any policy, design, or plan that would disregard this aspect and chose a static paradigm would undoubtably be either highly inefficient or provide insufficient resources. We show that using our suggested approach it is possible to model the potential utilization of ride sharing based on the topological properties of the rides network. We also show that using this method the potential utilization can be forecasting a few hours ahead of time. One anecdotal derivation of the latter is that perfectly guessing the destination of a New York taxi rider becomes nearly three times easier than rolling a “Snake Eyes” at a casino.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".