The hardness of train rearrangements

  • Authors:

  • Christian Eggermont;Cor A. J. Hurkens;Maciej Modelski;Gerhard J. Woeginger

  • Affiliations:

  • Department of Mathematics and Computer Science, TU Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics and Computer Science, TU Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics and Computer Science, TU Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics and Computer Science, TU Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands

  • Venue:
  • Operations Research Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.