MétaCan
Menu
Back to cohort
Record W2952987575 · doi:10.5383/jttm.01.01.002

Dynamic, multi- and intermodal bike sharing in agent-based modelling

2019· article· en· W2952987575 on OpenAlexvenueno aff
Cornelia Hebenstreit, Martin Fellendorf

Bibliographic record

VenueInternational Journal of Traffic and Transportation Management · 2019
Typearticle
Languageen
FieldSocial Sciences
TopicUrban Transport and Accessibility
Canadian institutionsnot available
FundersBundesministerium für Verkehr, Innovation und Technologie
KeywordsBike sharingTRIPS architectureCyclingTransport engineeringPublic transportParking spaceComputer scienceTraffic congestionMultimodal transportEnvironmental scienceOperations researchSimulationEngineeringGeography

Abstract

fetched live from OpenAlex

Negative effects of traffic, like congestion, air and noise pollution are among the reasons why environmentally friendly solutions are promoted. Bike sharing (bs) is intended to strengthen cycling and public transport. Nevertheless, current transport models rarely consider cycling or even bs, in either detail or holistically. In this paper we present an agent based approach to model cycling and in particular bs within the multimodal simulation environment MATSim. Multimodal trips combining public transport and bs are included as well as within day rescheduling of bs trips as agents may not find a bike or empty return space (parking spot). To minimize such cases, choice probabilities were implemented, so that agents only start their bs trip, if sufficient bikes or parking spots are available. The modules presented in this paper were applied using a MATSim model of the city of Vienna. Agent based bs modelling is an inexpensive option to test the impact of a bike sharing system before implementation.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.027
Threshold uncertainty score0.054

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.001
Open science0.0010.002
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0040.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.019
GPT teacher head0.297
Teacher spread0.278 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations4
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Traffic and Transportation ManagementSame topicUrban Transport and AccessibilityFrench-language works237,207