Nominal and robust train timetabling problems
From MaRDI portal
Publication:1926692
DOI10.1016/j.ejor.2011.11.003zbMath1253.90108OpenAlexW2095383966MaRDI QIDQ1926692
Valentina Cacchiani, Paolo Toth
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.003
Related Items
An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line, Freight railway operator timetabling and engine scheduling, High-speed railway scheduling based on user preferences, An iterative heuristic for passenger-centric train timetabling with integrated adaption times, Valid inequalities for the synchronization bus timetabling problem, An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems, An experimental comparison of periodic timetabling models, 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, Timetable rearrangement to cope with railway maintenance activities, Genetic based discrete particle swarm optimization for elderly day care center timetabling, A STOCHASTIC TIMETABLE OPTIMIZATION MODEL IN SUBWAY SYSTEMS, A look at the past and present of optimization - an editorial, Delay resistant line planning with a view towards passenger transfers, An optimization-based decision support tool for incremental train timetabling, The clique problem with multiple-choice constraints under a cycle-free dependency graph, Public transport for smart cities: recent innovations and future challenges, Scheduling shared passenger and freight transport on a fixed infrastructure, Robust metro train scheduling integrated with skip-stop pattern and passenger flow control strategy under uncertain passenger demands, Parcel Distribution Timetabling Problem with Incomplete Hub Network, Educational timetabling: problems, benchmarks, and state-of-the-art results, EETTlib—Energy‐efficient train timetabling library, Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks, Dynamic graph generation for the shortest path problem in time expanded networks, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm, Distribution analysis of train interval journey time employing the censored model with shifting character, Complexity, bounds and dynamic programming algorithms for single track train scheduling, Timetable coordination in a rail transit network with time-dependent passenger demand, Arc flow formulations based on dynamic programming: theoretical foundations and applications, A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing, Timetable optimization for high-speed trains at Chinese railways, Multi-train trajectory optimization for energy-efficient timetabling, A simulated annealing approach for the train design optimization problem, Optimal allocation of buffer times to increase train schedule robustness, Review of energy-efficient train control and timetabling, A survey on robustness in railway planning, Improving the robustness in railway station areas, Recent advances in robust optimization: an overview, Adjusting a railway timetable in case of partial or complete blockades, Exact formulations and algorithm for the train timetabling problem with dynamic demand, A minmax regret version of the time-dependent shortest path problem, A stochastic dynamic programming approach for delay management of a single train line, Simultaneous node and link districting in transportation networks: model, algorithms and railway application, Integrated timetabling and vehicle scheduling with balanced departure times, Integrated rolling stock deadhead routing and timetabling in urban rail transit lines, Railway timetabling with integrated passenger distribution, An efficient train scheduling algorithm on a single-track railway system, An experimental study of bicriteria models for robust timetabling, An analytical approach to calculate the capacity of a railway system, A novel mixed integer programming model for freight train travel time estimation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A column generation approach to train timetabling on a corridor
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
- Computing delay resistant railway timetables
- A fast heuristic for the train scheduling problem
- Discrete optimization in public rail transport
- A genetic algorithm approach to periodic railway synchronization
- Cost optimal periodic train scheduling
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- Developing railway timetables which guarantee a better service
- Heuristic techniques for single line train scheduling
- Railway Timetabling Using Lagrangian Relaxation
- A Survey of Optimization Models for Train Routing and Scheduling
- Dynamic Algorithms for Recoverable Robustness Problems.
- Models for Railway Track Allocation
- Modeling and Solving the Train Timetabling Problem
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Light Robustness
- A Bicriteria Approach for Robust Timetabling
- A Mathematical Model for Periodic Scheduling Problems
- A Model, Algorithms and Strategy for Train Pathing
- A Genetic Algorithm for Railway Scheduling Problems
- Operations Research in passenger railway transportation
