Optimal allocation of buffer times to increase train schedule robustness

DOI10.1016/j.ejor.2016.05.013zbMath1394.90281OpenAlexW2356436688MaRDI QIDQ1752165

Predrag Jovanović, Dragomir Mandić, Pavle Kecman, Nebojša J. Bojović

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.013

zbMATH Keywords

capacityknapsack problembuffer timestimetable robustness

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Related Items (3)

Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty ⋮ A survey on robustness in railway planning ⋮ A decision making procedure for robust train rescheduling based on mixed integer linear programming and data envelopment analysis

Uses Software

• MiniZinc

Cites Work

• Unnamed Item
• Multi-objective models and techniques for analysing the absolute capacity of railway networks
• Determining operations affected by delay in predictive train timetables
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• The quadratic knapsack problem -- a survey
• Evaluation of railway networks with single track operation using the UIC 406 capacity method
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Multiple attribute decision making. Methods and applications. A state-of- the-art survey
• The multidimensional 0-1 knapsack problem: an overview.
• Nominal and robust train timetabling problems
• A disjunctive graph model and framework for constructing new train schedules
• Reliability and heterogeneity of railway services
• Developing railway timetables which guarantee a better service
• Experiments with the “Oregon Trail Knapsack Problem”
• Balancing Efficiency and Robustness – A Bi-criteria Optimization Approach to Railway Track Allocation
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• MiniZinc with Functions
• Recoverable Robust Timetables: An Algorithmic Approach on Trees

This page was built for publication: Optimal allocation of buffer times to increase train schedule robustness