Optimal allocation of buffer times to increase train schedule robustness

DOI10.1016/J.EJOR.2016.05.013MaRDI QIDQ1752165zbMATH OpenOpenAlexFDO

Authors P. Jovanovic, Pavle Kecman, Dragomir Mandić, 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

buffer timescapacityknapsack problemtimetable robustness

Mathematics Subject Classification ID

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) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Balancing efficiency and robustness - a bi-criteria optimization approach to railway track allocation
• Developing railway timetables which guarantee a better service
• Fast approaches to robust railway timetabling
• Nominal and robust train timetabling problems
• Computing delay resistant railway timetables

Cites work

• A disjunctive graph model and framework for constructing new train schedules
• Balancing efficiency and robustness - a bi-criteria optimization approach to railway track allocation
• Determining operations affected by delay in predictive train timetables
• Developing railway timetables which guarantee a better service
• Evaluation of railway networks with single track operation using the UIC 406 capacity method
• Experiments with the ``Oregon Trail knapsack problem
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• MiniZinc with functions
• Multi-objective models and techniques for analysing the absolute capacity of railway networks
• Multiple attribute decision making. Methods and applications. A state-of- the-art survey
• Nominal and robust train timetabling problems
• Recoverable Robust Timetables: An Algorithmic Approach on Trees
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Reliability and heterogeneity of railway services
• The concept of recoverable robustness, linear programming recovery, and railway applications
• The multidimensional 0-1 knapsack problem: an overview.
• The quadratic knapsack problem -- a survey

Cited in

(6)

• A survey on robustness in railway planning
• Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty
• Improving the robustness in railway station areas
• A decision making procedure for robust train rescheduling based on mixed integer linear programming and data envelopment analysis
• Energy-saving time allocation strategy with uncertain dwell times in urban rail transit: two-stage stochastic model and nested dynamic programming framework
• A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows

Describes a project that uses

Uses Software

• MiniZinc

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752165)