An integrated dispatching model for rail yards operations

Authors:
Shiwei He;Rui Song;Sohail S. Chaudhry
Affiliations:
Department of Transportation Management Engineering, Northern Jiaotong University, Beijing 100044, People's Republic of China;Department of Transportation Management Engineering, Northern Jiaotong University, Beijing 100044, People's Republic of China;Department of Decision and Information Technologies, College of Commerce and Finance, Villanova University, 800 Lancaster Avenue, Villanova, PA
Venue:
Computers and Operations Research
Year:
2003

Citing 5
Cited 1

Scheduling jobs with fixed start and end times

Discrete Applied Mathematics
Algorithms for scheduling a single machine to minimize the weighted number of late jobs

Management Science
Optimal pacing of trains in freight railroads: model formulation and solution

Operations Research
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Algorithms for Network Programming

Algorithms for Network Programming

DSS development and applications in China

Decision Support Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Rail yards dispatcher must determine (1) how cars are transferred from one inbound train to another outbound train and what is the makeup of each outbound train, (2) how to use yard engines, (3) how to arrange yard track occupation. The sum total of these decisions is the basis of other decisions in rail yards. This paper presents the formulation and solution of a joint computer-aided dispatching model for the coordination of the above decisions. The objective here is to capture the tradeoff between benefits of reducing the staying time of cars in yards and the delay penalty costs. This formulation results in a mixed 0-1 programming and an optimal decomposing heuristic solution method is proposed. The tests with the practical instances demonstrate the reliability and efficiency of the algorithm.