Cost-Effective Multi-Modal Urban Transportation with Parking Selection
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.
Bibliographic record
Abstract
Reaching their destination at the lowest cost and the minimum delay is the main drivers’ goal. However, and due to unobservable or partially observed traffic congestion, most of the drivers hardly meet this goal under mono-modality. In this paper, we develop a graph-theoretic framework allowing to find out optimal multi-modal paths considering the driver preference and constraints (time, cost, comfort, etc.) Yet, our Intelligent Transport System (ITS) allows a driver to use his/her own car while traveling. Then, a parking station might be proposed before the driver continues traveling towards the final destination, through other suitable modalities and transportation facilities. This proposed path is mainly multi-modal and includes the best combination of transport-parking modes to reach a given destination. Our early simulation runs show promising results, as the optimal paths combine the three modalities (driving, walking, and riding) to respond to drivers’ mobility requests.
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 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.000 |
| 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 it