A Tactical Planning Model for Rail Freight Transportation

Abstract

This paper examines the problems of routing freight traffic, scheduling train services and allocating classification work between yards on a rail network. It describes a general optimization model which takes into account the interactions between these activities and develops global strategies for their management over a medium term planning horizon. A heuristic algorithm developed to solve this nonlinear, mixed-integer multicommodity flow problem is also presented with some computational results based on an example at the Canadian National Railroads.

Multi-objective mathematical modeling of an integrated train makeup and routing problem in an Iranian railway company

“…For example, Assad [5] presented a multi-commodity network flow model to analyze a TMP. To investigate tactical planning, in a programming model with a mixed-integer and non-linear nature solved by a heuristic method, Crainic et al [6] minimize delay and operating costs. Based on a heuristic approach and a Lagrangian relaxation technique, Keaton [7] developed a method to deal with a programming model with a mixed-integer structure.…”

Optimization of transportation requirements in the deployment of military units

“…Despite the fact that there is a rich body of literature on transportation planning (e.g., [16,17] for freight transportation; [18][19][20] for vehicle routing and scheduling; [21][22][23] for rail transportation; [24] for ocean transportation; [25] for lessthan-truckload trucking; and [26] for dynamic transportation), the models address only certain parts of the DPP. Just to mention a few important discrepancies from a modeling point of view, consider, for example, the vehicle routing/scheduling and fleet management problems.…”

Rail freight transportation: A review of recent optimization models for train routing and empty car distribution

“…Table 2 presents a list of references regarding these models as well as yard and blocking models. We review the optimization approaches to modelling rail network and empty car distribu- Crainic et al (1984) tion problems in detail. The yard and blocking models are referenced because they closely tie into the network and car distribution models.…”

“…Finally, Crainic et al (1984) formulated an optimization model which deals with routing, makeup and classification issues in a rail network. The model is a general mixed-integer nonlinear multicommodity flow problem.…”

“…Since this is a heuristic algorithm, there is no guarantee that it will provide the optimal solution. Similar to Petersen and Fullerton (1975) and Assad (l980a), Crainic et al (1984) do not address the car distribution problem. This model has been applied using a data set obtained from The Canadian National Railroads.…”