Graph learning-assisted logic-based Benders decomposition for distributionally robust in-station train rescheduling under disruptions
arXiv cs.AIen
arXiv:2611.07520v1 Announce Type: new Abstract: Uncertainty in resource reopening times complicates train holding and rerouting decisions when resource closures coincide with arrival delays and processing-time extensions. We develop a rolling-horizon distributionally robust model that updates predictions of the remaining closure duration as observations of disruption resolution become available. The model jointly optimizes train routes, sequences, and timings. It minimizes the worst-case expected total completion delay over an ambiguity set of scenario probabilities. The solution algorithm, GNN-LBBD, uses logic-based Benders decomposition to coordinate routing and resource scheduling. Condit
This is a short summary published by AI Global Wire. The full article is owned and hosted by arXiv cs.AI — open it there to read it in full.
Read the full story at arXiv cs.AI- Forskning
Related AI news
- BlockLock: Reproducible LLM Inference with Fixed Batch GeometryarXiv cs.AI · November 6, 2026
- Align Before Aggregation: Basis-Consistent Federated LoRA under Heterogeneous RanksarXiv cs.AI · November 6, 2026
- KDASO: Knowledge-Data Dual-Driven Automated Skill Optimization for Liability Adjudication TasksarXiv cs.AI · November 6, 2026
- Adapting the Process of Adaptation: Darwinian, Lamarckian, and Agent-Directed Evolution in AIarXiv cs.AI · November 6, 2026
- SAVeR$^2$: Reasoning-based Safety Alignment for Large Reasoning Models via Verifiable RewardsarXiv cs.AI · November 6, 2026
- Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent PathfindingarXiv cs.AI · November 6, 2026