MétaCan
Menu
Back to cohort
Record W3028428492 · doi:10.1287/trsc.2019.0950

Integrating Resource Management in Service Network Design for Bike-Sharing Systems

2020· article· en· W3028428492 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueTransportation Science · 2020
Typearticle
Languageen
FieldEngineering
TopicTransportation and Mobility Innovations
Canadian institutionsUniversité de MontréalUniversité du Québec à Montréal
Fundersnot available
KeywordsComputer scienceService (business)Operations researchNetwork planning and designRedistribution (election)Resource allocationHeuristicLevel of serviceTransport engineeringComputer networkEngineering

Abstract

fetched live from OpenAlex

Station-based bike-sharing systems rely on bike redistribution to provide users with an adequate service level. We propose a novel formulation of service network design that coordinates redistribution decisions in space and time to plan regular master tours. This formulation explicitly integrates resource-management decisions by considering a limited redistribution budget to acquire and operate vehicles, as well as an accurate time representation of pickups and deliveries of bikes at stations. We propose a matheuristic relying on a neighborhood search scheme to find solutions of good quality for real-world-sized problem instances in reasonable time. To produce starting solutions, we propose a construction heuristic decomposing the daytime redistribution process into three sequential phases: determine pickups and deliveries, link pickups and deliveries into transport requests, and assign transport requests to master tours. We evaluate the operational performance of master tours with a discrete-event simulation approach. We show that master tours improve the level of service in bike-sharing systems with high and regular mobility patterns, for example, commuting activities.

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.881
Threshold uncertainty score0.467

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.002
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.060
GPT teacher head0.268
Teacher spread0.208 · 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