Algorithms For Optimizing Yard Operations FL05-INOV

1. Algorithms For Optimizing Yard Operations FL05-INOV Project Team Principal Investigator Prof. Ravindra K. Ahuja Graduate Assistant Guvenc Sahin Undergraduate Assistant Siddhartha Mohapatra Project Motivation • Blocking Capability of Railroads • Yards are nerve centers of the railroad network • Efficiency of yard operations determine the blocking capacity • Increased blocking capacity decreases transportation costs • Yard Operations • Humping (process inbound trains) • Classification (make outbound blocks) • Block Assembly (process outbound trains) Project Objectives • Model and analyze the current yard operations • New optimization-based policies for humping, classification, and assembly • Develop simulation-based decision support system to compare different policies Project Activities • Current process analysis • Identify targets for the railroads • Heuristic approaches for optimization models • Develop computerized simulation-based tools • Develop user interface for simulation-models • Data collection • Validation Research Methodology Solution Methods • Humping Sequence • Pairwise exchange and neighborhood search • Classification Tracks • Bin packing problem with time component • Humping and Assembly Sequence • Network-flow based integer programming formulation • Compare humping and assembly policies • Simulation tools • Computerized user interface Optimization Algorithms • Multi-objective decision making • Increase utilization of tracks • Minimize average dwell time per car • Minimize processing times for trains • Minimize switching to assemble the outbound trains • Minimize number of missed connections • Heuristic Algorithms • To allocate inbound trains on receiving tracks and to find humping sequence • To allocate classification tracks to outbound blocks • To find assembly sequence of outbound trains Receiving Tracks Classification Tracks Departure Tracks Switch Hump