Resilient synchromodal transport through learning assisted hybrid simulation optimization model
Bibliographic record
Abstract
• Proposed and evaluated a hybrid simulation-optimization framework integrated with reinforcement learning for effective disruption management in synchromodal freight transport. • Developed a discrete-event simulation framework to model the dynamic behavior of the system under disruption. • Extensive disruption profiles were considered and utilized in numerical experiments to analyze their impact on shipments. • The framework is tested using a real-world-inspired case study, highlighting its practical applicability and effectiveness. • The proposed model demonstrated a superior performance compared to benchmark policies across different disruption scenarios. Disruptions and uncertainties can significantly reduce the efficiency of conventional intermodal transport, often leading to severe economic losses and deterioration in service levels. To mitigate the negative impacts of disruptions on the shipments, our research leverages the flexibility of synchromodality and develops a learning-based modular framework for disruption management. By utilizing a hybrid simulation-optimization modeling approach, the framework effectively captures disruptions and generates dynamic response strategies. Through the integration of Reinforcement Learning (RL), the proposed approach re-plans under disruptions, accounting for their stochastic characteristics, enabling swift and effective decision-making in real-time scenarios. Results are compared against two policies, always wait and always reassign, highlighting the superior performance of the RL approach, when exposed to a certain disruption profile, with comparable or better decisions compared to other policies in response to disruptions. Additionally, results are compared against a benchmark policy to test an alternative reward mechanism, demonstrating that integrating a cost-based reward mechanism increases its resilience and results in lower costs, especially in the case of more frequent and low to moderately severe disruptions.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| 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".