optimization of dynamic trip plannin g problem for railroads
Download
Skip this Video
Download Presentation
Optimization of Dynamic Trip Plannin g Problem for Railroads

Loading in 2 Seconds...

play fullscreen
1 / 13

Optimization of Dynamic Trip Plannin g Problem for Railroads - PowerPoint PPT Presentation


  • 118 Views
  • Uploaded on

Optimization of Dynamic Trip Plannin g Problem for Railroads. Yazhe Feng Kimberly Ellis, Ph.D. Yasemin Merzifonluoglu , Ph.D. Center for Excellence in Logistics and Distribution Conference Dallas, TX October 20, 2010. Project Overview.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Optimization of Dynamic Trip Plannin g Problem for Railroads' - badrani


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
optimization of dynamic trip plannin g problem for railroads

Optimization of Dynamic Trip Planning Problem for Railroads

YazheFeng

Kimberly Ellis, Ph.D.

YaseminMerzifonluoglu, Ph.D.

Center for Excellence in Logistics

and Distribution Conference

Dallas, TX

October 20, 2010

project overview
Project Overview
  • US railroads ship millions of shipments over their railroad networks annually.
  • To prevent shipments from being reclassified at every yard through which they pass, railroads group several shipments together to form a block.
  • Innovative Scheduling has developed a decision support system for the railroad blocking problem.
  • The focus of this project is the dynamic trip planning problem.
problem description
Problem Description

Given a blocking plan, train schedule, and block-to-train assignment, the dynamic trip planning problem assigns shipments to blocks and blocks to particular trains so that all operational constraints are satisfied and the total cost of transportation is minimized.

project activities
Project Activities
  • Developed network representations
    • Train-block network
project activities1
Project Activities
  • Developed network representations
    • Train-block network
    • Time-space and Train-block network
project activities2
Project Activities
  • Developed large scale network flow model
    • Arc-based formulation
      • Conventional model
      • Large size!
    • Path-based formulation
      • Modeled for a set of feasible paths
      • Size reduced!
project activities3
Project Activities
  • Developed a sequential solution approach
    • Send waybills sequentially

Train capacity is violated

Find the (possible) minimum cost block path

Determine the (possible) fastest train route

Due date is not met

project activities4
Project Activities
  • Developed an alternative solution approach
    • Send all waybills together along their optimal block path and train route
    • Identify the train segment where the capacity constraint is violated, rearrange the waybills on that train segment
    • Prevent potential repetitive operations
project activities5
Project Activities
  • Implemented both sequential approach and alternative approach in C++
  • Conducted analysis using data provided by Innovative Scheduling
case scenario
Case Scenario
  • Data provided by Innovative Scheduling for:
    • 3738 stations
    • 6146 blocks
    • 2259 trains
    • 455,888 waybills
summary
Summary
  • Interesting, challenging, and realistic transportation problem.
  • Quality solutions need to be obtained quickly for large scale problems.
  • Both the sequential and alternative algorithms performed well.
ad