Journal ArticleDOI
A fast heuristic for the train scheduling problem
Xiaoqiang Cai,C. J. Goh +1 more
Reads0
Chats0
TLDR
This work proposes an algorithm based on local optimality criteria in the event of a potential crossing conflict which can be obtained very quickly in polynomial time and furnish a complexity analysis to show the NP-completeness of the problem.About:
This article is published in Computers & Operations Research.The article was published on 1994-05-01. It has received 159 citations till now. The article focuses on the topics: Job shop scheduling & Time complexity.read more
Citations
More filters
Journal ArticleDOI
Modeling and Solving the Train Timetabling Problem
TL;DR: A graph theoretic formulation for the train timetabling problem using a directed multigraph in which nodes correspond to departures/arrivals at a certain station at a given time instant is proposed, used to derive an integer linear programming model that is relaxed in a Lagrangian way.
Journal ArticleDOI
An Assessment of Railway Capacity
TL;DR: In this paper, an in-depth study of the main factors that in∞uence railway capacity is performed on several Spanish railway infrastructures, and the results show how the capacity varies according to factors such as train speed, commercial stops, train heterogeneity, distance between railway signals, and timetable robustness.
Journal ArticleDOI
Nominal and robust train timetabling problems
Valentina Cacchiani,Paolo Toth +1 more
TL;DR: An overview of the main works on train timetabling is presented, underlining the differences between models and methods that have been developed to tackle the nominal and the robust versions of the problem.
Journal ArticleDOI
Railway track allocation: models and methods
TL;DR: This paper surveys work on the train timetabling, train dispatching, train platforming, and train routing problems, group them by railway network type, and discusses track allocation from a strategic, tactical, and operational level.
Book ChapterDOI
Passenger Railway Optimization
TL;DR: This chapter discusses the European situation, where the major part of railway transportation consists of passenger transportation without addressing important problems in cargo transportation—such as car blocking, train makeup, train routing, and empty car distribution.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Railway scheduling by network optimization
TL;DR: This paper presents an efficient approximate algorithm which can find good feasible solutions for real-world networks quickly with modest computing resources.
Journal ArticleDOI
Optimal control on a graph with application to train scheduling problems
C. J. Goh,A. I. Mees +1 more
TL;DR: This paper is an effort at modelling dynamical network systems by suitably defined differential equations on the arc flows and node requirements by formulated as an optimal control problem defined on a graph.