scispace - formally typeset
Journal ArticleDOI

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

Ali E. Haghani
- 01 Jun 1987 - 
- Vol. 21, Iss: 2, pp 147-172
TLDR
In this paper, the authors describe two types of rail transportation problems in detail: train routing and makeup, and empty car distribution problems, and some of the recent optimization models which address these problems are reviewed.
Abstract
This paper describes two types of rail transportation problems in detail. These are train routing and makeup, and empty car distribution problems. Some of the recent optimization models which address these problems are reviewed and the areas for potential improvements in rail transportation literature are identified. The type of interactions which exist between routing, makeup, and empty car distribution decisions are highlighted and potential areas for future research are identified.

read more

Citations
More filters
Journal ArticleDOI

A Survey of Optimization Models for Train Routing and Scheduling

TL;DR: A survey of recent optimization models for the most commonly studied rail transportation problems is presented and a classification of models is proposed and their important characteristics are described by focusing on model structure and algorithmic aspects.
Journal ArticleDOI

A multi-objective train scheduling model and solution

TL;DR: In this paper, a multi-objective optimization model for the passenger train-scheduling problem on a railroad network which includes single and multiple tracks, as well as multiple platforms with different train capacities is developed.
Journal ArticleDOI

Formulation and solution of a combined train routing and makeup, and empty car distribution model

TL;DR: In this article, the authors presented the formulation and solution of a combined train routing and makeup, and empty car distribution model, which results in a large scale mixed-integer programming problem with nonlinear objective function and linear constraints.

Network Models in Railroad Planning and Scheduling

TL;DR: Algorithms are described that can solve very large-scale integer programming problems containing billions or even trillions of integer variables within one to two hours of computational time, which are currently being solved manually by U.S. railroads.
Journal ArticleDOI

Integrated operations planning and revenue management for rail freight transportation

TL;DR: A new bilevel mathematical formulation is proposed which encompasses pricing decisions and network planning policies such as car blocking and routing as well as train make-up and scheduling which bridges the gap between railroad operations planning and revenue management.
References
More filters
Journal ArticleDOI

Partitioning procedures for solving mixed-variables programming problems

TL;DR: In this article, the 8th International Meeting of the Institute of Management Sciences, Brussels, August 23-26, 1961, the authors presented a paper entitled "The International Journal of Management Science and Management Sciences".
Journal ArticleDOI

Models for rail transportation

TL;DR: In this paper, the authors report on the existing literature models for rail transportation with two goals in mind: (a) to collect and categorize rail modelling efforts, and (b) to position the rail-related literature in the context of other transportation models and provide an introduction to this field for nonspecialists.
Journal ArticleDOI

A Tactical Planning Model for Rail Freight Transportation

TL;DR: 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 is described.
Journal ArticleDOI

Dynamic transshipment networks: an algorithm and its application to the distribution of empty containers

William W. White
- 01 Jan 1972 - 
TL;DR: An inductive out-of-skilter type of algorithm is presented which utilizes the basic underlying properties of the dynamic transshipment network to optimize the flow of a homogeneous commodity through the network, given a linear cost function.
Related Papers (5)