Using Integer Programming to Solve the Train-Platforming Problem

Alain Billionnet ()
Additional contact information
Alain Billionnet: CEDRIC-IIE, 18 Allée Jean Rostand, 91025 Evry Cedex, France

Transportation Science, 2003, vol. 37, issue 2, 213-222

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.

Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.37.2.213.15250 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:37:y:2003:i:2:p:213-222

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().