Solution of the Train Platforming Problem

Alberto Caprara (), Laura Galli () and Paolo Toth ()
Additional contact information
Alberto Caprara: DEIS, University of Bologna, 40136 Bologna, Italy
Laura Galli: DEIS, University of Bologna, 40136 Bologna, Italy
Paolo Toth: DEIS, University of Bologna, 40136 Bologna, Italy

Transportation Science, 2011, vol. 45, issue 2, 246-257

Abstract: In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a case study from Rete Ferroviaria Italiana, the Italian Infrastructure Manager. In particular, motivated by our case study, we consider a general quadratic objective function, and propose a new way to linearize it by using a small number of new variables along with a set of constraints that can be separated efficiently by solving an appropriate linear program. The resulting integer linear programming formulation has a continuous relaxation that leads to strong bounds on the optimal value. For the instances in our case study, the solution approach based on this relaxation produces solutions that are much better than those produced by a simple heuristic method currently in use, and that often turn out to be (nearly) optimal.

Keywords: train platforming; 0.1 quadratic programming; linearization (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1100.0366 (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:45:y:2011:i:2:p:246-257

Access Statistics for this article

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