Session Detail Information
Add this session to your itinerary

Cluster :  Railroad Applications

Session Information  : Monday Oct 20, 08:00 - 09:30

Title:  Railroad Blocking and Scheduling Approaches
Chair: Pooja Dewan,BNSF Railway, Fort Worth TX, United States, Pooja.dewan@bnsf.com

Abstract Details

Title: Deriving Tag Tables from Algorithmic Blocking in First Class
 Presenting Author: Carl Van Dyke,MultiModal Applied Systems, Inc., 125 Village Blvd - Suite 270, Princeton NJ, United States, Carl@multimodalinc.com
 Co-Author: David Friedman,MultiModal Applied Systems, Inc., 125 Village Blvd - Suite 270, Princeton NJ 08540, United States, david@multimodalinc.com
 Erika Yazid,MultiModal Applied Systems, Inc., 125 Village Blvd - Suite 270, Princeton NJ, United States, Erika@multimodalinc.com
 
Abstract: Most railways route railcars using a table lookup scheme that involves 400K+ business rules. Algorithmic routing of railcars uses far fewer business rules, decreases car miles and intermediate handlings, simplifies blocking plans and eases analysis. The FirstClass project between CSX and MultiModal developed a tool to translate algorithmic routing rules to the lookup rules. Hence railways can gain the benefits of algorithms without a major redesign of their legacy train operating systems.
  
Title: A Decision Support System for Train Scheduling
 Presenting Author: Ravindra Ahuja,Professor, University of Florida, 303, Weil Hall, P O Box 116595, Gainesville FL 32608, United States, ahuja@ufl.edu
 Co-Author: Dharma Acharya,Senior Director, CSX Transportation, 500 Water Street, Jacksonville FL 32202, United States, Dharma_Acharya@CSX.com
 Pooja Dewan,BNSF Railway, Fort Worth TX, United States, Pooja.dewan@bnsf.com
 Krishna Jha,University of Florida, 303 Weil Hall, ISE Department, Gainesville FL 32611, United States, kcjha@ufl.edu
 
Abstract: We are developing a decision support system for train scheduling which will take as an input a blocking plan, a set of origin-destination shipments, and a given train schedule, and will allow us to assess the impact of adding trains, removing trains, changing train itinerary and its time schedule. The decision support system can also suggest a zero-based train schedule or some specific changes with maximum cost savings.
  
Title: Solving Real-Life Railroad Blocking Problems
 Presenting Author: Jian Liu,University of Florida, 303 Weil Hall, Gainesville FL 32608, United States, liujian@ufl.edu
 Co-Author: Dharma Acharya,Senior Director, CSX Transportation, 500 Water Street, Jacksonville FL 32202, United States, Dharma_Acharya@CSX.com
 Ravindra Ahuja,Professor, University of Florida, 303, Weil Hall, P O Box 116595, Gainesville FL 32608, United States, ahuja@ufl.edu
 Pooja Dewan,BNSF Railway, Fort Worth TX, United States, Pooja.dewan@bnsf.com
 
Abstract: Blocking problem is one of the most important problems in railroad scheduling. In this talk, we will give an overview of a very-large scale neighborhood search algorithm to solve this problem which is very robust, flexible and can easily incorporate a variety of practical constraints. We will also present computational results on solving these problems at CSX Transportation and BNSF Railway.