Martin Joborn

Improved Empty Freight Car Distribution

In this paper we consider the problem of distributing empty freight cars in a railway company. We describe and analyze the current planning process, identify the shortcomings of the process, and stress the importance of a reliable distribution process for satisfying customer demand and reducing capital costs. We show how the process can be improved using an optimization model which includes capacity constraints on the trains and adheres explicitly to the arrival and departure times of the trains. The optimization model can be characterized as a multicommodity network flow model with integer requirements. Computational tests show that the model can be solved in acceptable time for real size problems, and indicate that the model generates distribution plans that can improve the quality of the planning process.

Economies of Scale in Empty Freight Car Distribution in Scheduled Railways

In this paper, we consider empty freight car distribution in a scheduled railway system. We analyze the cost structure for the repositioning of empty cars, and conclude that the distribution cost shows an economy-of-scale behavior. In addition to the cost proportional to the number of cars sent from origin to destination, there is a cost related to car-handling operations at yards, which depends on the number of car groups that are handled. Thus, if we can find a transportation pattern in which fewer but larger groups of cars are built, the total distribution cost can be decreased.The objective of the paper is to propose an optimization model that explicitly takes this economy-of-scale effect into account. We use a time-dependent network to describe the possible car movements in time and space, and show how this network can be transformed into a network with fixed costs on links representing movements of cars with identical origin and destination terminals. The resulting optimization model is a capacitated network design model, where each capacity constraint limits the flow on several arcs. We describe a tabu heuristic for solving the model, and present computational results.

Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths

We study the multicommodity network flow problem with fixed costs on paths, with specific application to the empty freight car distribution process of a rail operator. The classification costs for sending a group of cars do not depend on the number of cars in the group, as long as the group is kept together as one unit. Arcs correspond to trains, so we have capacity restrictions on arcs but fixed costs on the paths corresponding to routes for groups of cars. As solution method, we propose a Lagrangian based heuristic using dual subgradient search and primal heuristics based on path information of the Lagrangian subproblem solutions. The method illustrates several ways of exploiting the specific structures of the problem. Computational tests indicate that the method is able to generate fairly good primal feasible solutions and lower bounds on the optimal objective function value.

Dimensioning windows for railway infrastructure maintenance: Cost efficiency versus traffic impact

The Swedish Transport Administration is introducing a new regime, called maintenance windows, for allocating train free slots reserved for maintenance tasks on the railway infrastructure. In this p ...

Towards a comprehensive model for track allocation and roll-time scheduling at marshalling yards☆

This paper considers multi-stage train formation with mixed usage tracks at a marshalling yard without departure yard. A novel integer programming model for scheduling shunting tasks as well as allocating arrival yard tracks and classification bowl tracks is presented. By taking a comprehensive view of the marshalling yard operations, more effective schedules can be found, and a variety of characteristics can be optimised, including shunting work effort, number or cost of tracks, and shunting task start times. Two different objective functions are evaluated: minimising work effort in terms of wagon pull-backs and minimising track costs. A procedure for finding a hot-start solution with few wagon pull-backs is also presented. The proposed model is tested on real data from Savenas marshalling yard in Sweden. The results show that the method is able to return an optimal schedule for a planning period of 4 days if the hot-start solution is optimal or the remaining problem is tractable for the heuristics in CPLEX.

Abstracts for the 2001 Transportation Science Section Dissertation Prize Competition

The accuracy of multilateration systems can be greatly improved by using a correction method based on the SLS (Sideband Lobe Suppression) signal produced by a Secondary Surveillance Radar (SSR). Multilateration is a cooperative surveillance technique for aircraft equipped with Air Traffic Control Radar Beacon System (ATCRBS), Mode S, or Automatic Dependent Surveillance Broadcast (ADS-B) transponders. When one of these transponders aboard a vehicle is interrogated, it responds by broadcasting a message based on what the interrogation requests. These reply messages may be multilaterated to determine the source position of the transmission. Multilateration is a Time Difference of Arrival (TDOA) technique similar to triangulation. Multilateration can be performed to locate the transmission source of any SSR signal. Error detection and correction may be performed on the system by conducting a comparison of a known TDOA for the receiver/transmitter geometry, to the measured TDOA from a Side Lobe Suppression (SLS) pulse emanating from a primary radar.