Nominal and robust train timetabling problems
type: Item
instance of: scholarly article
title: Nominal and robust train timetabling problems
zbMATH Open document ID: 1253.90108
author: Valentina Cacchiani
author: Paolo Toth
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6119326
zbMATH Keywords: train timetabling
zbMATH Keywords: transportation
zbMATH Keywords: cyclic and non-cyclic timetabling
zbMATH Keywords: nominal and robust problems
describes a project that uses: PESPLib
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.11.003
OpenAlex ID: W2095383966
cites work: Railway timetabling using Lagrangian relaxation
cites work: Models for railway track allocation
cites work: Discrete optimization in public rail transport
cites work: A column generation approach to train timetabling on a corridor
cites work: A fast heuristic for the train scheduling problem
cites work: Modeling and Solving the Train Timetabling Problem
cites work: Q3523238
cites work: A Lagrangian heuristic algorithm for a real-world train timetabling problem
cites work: A Model, Algorithms and Strategy for Train Pathing
cites work: Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
cites work: Dynamic algorithms for recoverable robustness problems
cites work: A survey of optimization models for train routing and scheduling
cites work: Q5687193
cites work: Light Robustness
cites work: Heuristic techniques for single line train scheduling
cites work: Operations Research in passenger railway transportation
cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
cites work: Q3525416
cites work: Q3525417
cites work: Computing delay resistant railway timetables
cites work: Q4450523
cites work: Cost optimal periodic train scheduling
cites work: Q4436890
cites work: A genetic algorithm approach to periodic railway synchronization
cites work: Q2759921
cites work: A Bicriteria Approach for Robust Timetabling
cites work: A Mathematical Model for Periodic Scheduling Problems
cites work: A Genetic Algorithm for Railway Scheduling Problems
cites work: Developing railway timetables which guarantee a better service
DOI: 10.1016/J.EJOR.2011.11.003
Recommended article: Modeling and Solving the Train Timetabling Problem
Recommended article: Fast approaches to robust railway timetabling
Recommended article: Exact formulations and algorithm for the train timetabling problem with dynamic demand
Recommended article: Robust train routing and online re-scheduling
Recommended article: Train scheduling: hardness and algorithms
Recommended article: Q4474107
Recommended article: Q3142443
Recommended article: The demand-dependent optimization of regular train timetables
Recommended article: Railway timetabling using Lagrangian relaxation
description: scientific article; zbMATH DE number 6119326