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.
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.
Optimization of Dynamic Trip Planning Problem for Railroads
Kimberly Ellis, Ph.D.
Center for Excellence in Logistics
and Distribution Conference
October 20, 2010
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.
Train capacity is violated
Find the (possible) minimum cost block path
Determine the (possible) fastest train route
Due date is not met