Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Using Integer Programming to Solve the Train-Platforming Problem

Using Integer Programming to Solve the Train-Platforming Problem We consider the problem of assigning trains to the available tracks at a railway station, given the daily timetable and the structural and operational constraints. This trainplatforming problem is a key problem in railway station operations, and for a large station, many working days are required for an expert planner to construct the train-platforming. This problem was studied in De Luca Cardillo and Mione (1998), where it is formulated as a graph-coloring problem. These authors propose to solve it by an efficient heuristic algorithm combined with reduction techniques. In this paper, we show that integer programming is a very interesting tool to exactly solve the train-platforming problem as formulated in De Luca Cardillo and Mione (1998) by a graph-coloring problem. The fact of being able to solve it in an exact way by using an integer-programming solver obviously has many advantages. Some computational results are reported. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Transportation Science INFORMS

Using Integer Programming to Solve the Train-Platforming Problem

Transportation Science , Volume 37 (2): 10 – May 1, 2003
10 pages

Loading next page...
 
/lp/informs/using-integer-programming-to-solve-the-train-platforming-problem-qF26TBQLBS

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0041-1655
eISSN
1526-5447
DOI
10.1287/trsc.37.2.213.15250
Publisher site
See Article on Publisher Site

Abstract

We consider the problem of assigning trains to the available tracks at a railway station, given the daily timetable and the structural and operational constraints. This trainplatforming problem is a key problem in railway station operations, and for a large station, many working days are required for an expert planner to construct the train-platforming. This problem was studied in De Luca Cardillo and Mione (1998), where it is formulated as a graph-coloring problem. These authors propose to solve it by an efficient heuristic algorithm combined with reduction techniques. In this paper, we show that integer programming is a very interesting tool to exactly solve the train-platforming problem as formulated in De Luca Cardillo and Mione (1998) by a graph-coloring problem. The fact of being able to solve it in an exact way by using an integer-programming solver obviously has many advantages. Some computational results are reported.

Journal

Transportation ScienceINFORMS

Published: May 1, 2003

References