MétaCan
Menu
Back to cohort
Record W2564833931

Dynamic Optimization Models for Ridesharing and Carsharing

2014· dissertation· en· W2564833931 on OpenAlex
Mehdi Nourinejad

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueTSpace · 2014
Typedissertation
Languageen
FieldEngineering
TopicTransportation and Mobility Innovations
Canadian institutionsnot available
FundersUniversity of Toronto
KeywordsRevenueBenchmark (surveying)Car sharingTransport engineeringRevenue managementService (business)Operations researchComputer scienceFuel efficiencyBusinessEngineeringMarketingAutomotive engineering
DOInot available

Abstract

fetched live from OpenAlex

Collaborative consumption is the culture of sharing instead of ownership in consumer behaviours. Transportation services such as ridesharing, carsharing, and bikesharing have recently adopted collaborative business models. Such services require real-time management of the available fleets to increase revenues and reduce costs. This thesis proposes two dynamic models for real-time management of carsharing and ridesharing services. In ridesharing, an assignment problem is solved to match drivers with passengers. The model is expanded to include multi-passenger and multi-driver matches. In carsharing, vehicles are relocated between parking stations to service the users. Results of the two models are compared to benchmark models which provide lower-bound solutions.

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.

Full frame distilled prediction

Teacher imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.830
Threshold uncertainty score0.834

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.014
GPT teacher head0.285
Teacher spread0.271 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it