Multichannel queueing behaviour in urban bicycle traffic
Bibliographic record
Abstract
The objective of this paper is to propose a method to analyse and describe cyclists’ behaviour at signalized intersections with specific focus on the multichannel (multi-lane) queue phenomenon. As we observed, cyclists form queues without a fixed-lane and FIFO discipline, for which the classical, car-oriented analytical approach becomes insufficient. Cyclists’ multichannel queueing behaviour is common and characterized by substantial degree of variability, especially in case of shorter queues which emerge regularly at cycle crossings. Although cyclist behaviour has been widely studied by transportation research community, their queueing behaviour picture is still incomplete. Namely, there is no method addressed to analyse the full scope of these phenomena and to quantify their impact on the cyclist queue performance. To bridge this gap, we introduce the technique to observe multichannel queues and report relevant observations, which we then complement with a methodological framework to analyse obtained results and provide a complete multichannel queue description. We video-record cyclists as they enqueue to one of multiple channels, form the queue and smoothly merge into a single lane again as the queue discharges. We apply the method to analyse results from a pilot study of 160 cyclists forming 50 queues in the city of Krakow, Poland. The proposed method allows us to analyse and quantify the observed queue performance and its characteristics: the number of channels, their emergence process, channel and queue lengths, discharge process with FIFO violations, starting and discharging times. Findings from pilot study reveal that both queue length and discharge times strongly depend on queue formation process. The contribution of this paper is the method to describe multichannel cyclist queueing behaviour, enriching current picture of bicycle flow and cyclists’ behaviour. Since the method has been developed on relatively short queues (up to 10 cyclists), findings included in this paper primarily refer to such queue sizes. Nonetheless, the method is formulated in a generic way, applicable also for longer bicycle queues. Possible practical implications are new estimates for queue lengths and discharge times - useful for bicycle infrastructure design and traffic engineering purposes.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".