Express shipments with autonomous robots and public transportation
Bibliographic record
Abstract
Growing urbanization, exploding e-commerce, heightened customer expectations, and the need to reduce the environmental impact of transportation ask for innovative last-mile delivery solutions. This paper explores a new express shipment model that combines public transportation with Autonomous Robots (ARs) and studies its real-time management. Under dynamic demand arrivals with short delivery time promises, we propose a rolling horizon framework and devise a machine learning-enhanced Column Generation (CG) methodology to solve the real-time AR dispatching problem. The results of our numerical experiments with real-world delivery demand data show the significant potential of the proposed system to reduce travel time, vehicle traffic, emissions, and noise. Our results also reveal the efficacy of the learning-based CG methodology, which provides almost the same quality solutions as the classical CG approach with much less computational effort. • A novel public transport- and Autonomous Robots (ARs)-based delivery system. • A machine learning-enhanced methodology to solve the real-time dispatching problem. • Exploration of three re-positioning policies for ARs to consider future orders. • Experiments with real-world data that show the potential of the proposed system.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".