The hardness of train rearrangements

We derive several results on the computational complexity of train rearrangement problems in railway optimization. Our main result states that arranging a departing train in a depot is NP-complete, even if each track in the depot contains only two cars.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 37; no. 2; pp. 80 - 82
Main Authors Eggermont, Christian, Hurkens, Cor A.J., Modelski, Maciej, Woeginger, Gerhard J.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 01.03.2009
Elsevier
Subjects
Applied sciences
Computational complexity
Exact sciences and technology
Ground, air and sea transportation, marine construction
Operational research and scientific management
Operational research. Management science
Planning
Railway optimization
Railway transportation and traffic
Scheduling, sequencing
Shunting
Shunting
Planning
Railway optimization
Computational complexity
NP complete problem
Scheduling
Rail transportation
Hardness
Terminal
Mathematical programming
Online AccessGet full text

Cover

More Information
Summary:We derive several results on the computational complexity of train rearrangement problems in railway optimization. Our main result states that arranging a departing train in a depot is NP-complete, even if each track in the depot contains only two cars.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2008.12.005