Train formation planning models determine the routing and frequency of trains and assign the wagons to trains. In this article, a new robust mixed integer model for the train formation problems is proposed where the input data are subject to uncertainty. The optimal solution of the proposed model of this article is believed to be difficult to determine and a heuristic approach to find the near-optimal solution is presented. The implementation of the proposed model of this article is demonstrated for a real-world case study and the results are discussed.
KeatonM H‘Designing railroad operating plans: A dual adjustment method for implementing Lagrangian relaxation’Transp. Sci.26 (1992): 263–279
6.
LinC C‘The freight routing problem of time-definite freight delivery common wagonriers’Transp. Res. B35 (2001): 525–547
7.
MarinASalmeronJ‘Tactical design of rail freight networks. Part 1: Exact and heuristic methods’Eur. J. Oper. Res.90 (1996): 26–44
8.
MarinASalmeronJ‘Tactical design of rail freight networks. Part 2: Local search method with statistical analysis’Eur. J. Oper. Res.94 (1996): 43–53
9.
MorlokE KPetersonR B‘Final report on a development of a geographic transportation network generation and evaluation model’J. Trans. Res. Forum11 (1970): 71–105
10.
HuntleyC LBrownD ESappingtonD EMarkowiczB P‘Freight routing and scheduling at CSX Transportation’Interfaces253 (1995): 58–71
11.
GormanM F‘An application of genetic and Tabu searches to the freight railroad operating plan problem’Ann. Oper. Res.78 (1998): 51–69
12.
GodwinTGopalanRNarendrantT T‘Freight train routing and scheduling in a passenger rail network: Computational complexity and the stepwise dispatching heuristic’Asia-Pac. J. Oper. Res. (APJOR)244 (2007): 499–533
13.
FatholahiAArbabiEHeshmatiMBahramiMKianfarYJudkhahARailway running general regulations (in Persian) (Iran: RAI) 1990
14.
Ben-TalANemirovskiA‘Robust solutions of linear programming problems contaminated with uncertain data’Math. Prog. A88 (2000): 411–424
15.
BertsimasDSimM‘The price of robustness’Oper. Res.52 (2004): 35–53
16.
SoysterA L‘Convex programming with set-inclusive constraints and applications to inexact linear programming’Oper. Res.21 (1973): 1154–1157
