Inventory and Models in Project 3 Load Driven Systems John H. Vande Vate Spring, 2001.

Slides:



Advertisements
Similar presentations
Facility Location Decisions
Advertisements

OR Modeling in Intermodal: Intermodal Railcar Management Dharma Acharya, Jagadish Jampani, Aihong Wen.
1 Department of Business Administration SPRING Management Science by Asst. Prof. Sami Fethi © 2007 Pearson Education.
Spring 02 Vande Vate 1 1 Modeling Service When Transport is restricted to Load-Driven Pool Points in Retail Distribution John Vande Vate Spring.
Observations from Analyzing GM New Car Delivery Network Data
“Batching Policy in Kanban Systems”
CE 578 Highway Traffic Operations Freeway Merge and Diverge Segments.
Smooth Priorities for Make-to-Stock Inventory Control Carlos F. G. Bispo Instituto de Sistemas e Robótica – Instituto Superior Técnico Technical Univ.
Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.
Determining Truck Speeds using Rimpull and Retarder Curves
Load Driven Distribution Systems zDo not run on a schedule zWait for the vehicle to fill zMost examples are unfamiliar yRetail industry -- like DCs in.
The Ethanol Project A Feasibility Study Government and Policy.
Ford Motor Company’s Finished Vehicle Distribution System April 2001 Ellen Ewing Project Director UPS Logistics Dr. John Vande Vate Exec. Director EMIL.
Ford Motor Company’s Finished Vehicle Distribution System April 2001 Ellen Ewing Project Director UPS Logistics Dr. John Vande Vate Exec. Director EMIL.
Network Models II Shortest Path Cross Docking Enhance Modeling Skills Modeling with AMPL Spring 03 Vande Vate.
1 1 Summary of First Section: Deterministic Analysis John H. Vande Vate Spring, 2007.
TRANSPORTATION MANAGEMENT
1 1 Transportation & Supply Chain Costs John H. Vande Vate Spring, 2001.
The Supply Chain Customer Supplier Manufacturer Distributor
RAIL TRANSPORT SEMINAR: RAILWAY INFRASTRUCTURE – KEY TO ACHIEVE SUSTAINABLE TRANSPORT Operation on the Bulgarian railway market – current situation and.
1 1 1-to-Many Distribution Vehicle Routing John H. Vande Vate Spring, 2005.
Modeling the Interaction Between Railroad Freight Schedule Adherence and Asset Utilization Yan Dong* Joseph M. Sussman** Carl D. Martland** * Transport.
1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001.
LOGISTICS MANAGEMENT 2. Definition Of LOGISTIS What is Logistics ?  “ Logistics means having the right thing at the right place, at the right time 
1 1 Practice Final John H. Vande Vate Fall, 2002.
1 1 ISyE 6203 Modeling Multi-DC version of Pooling John H. Vande Vate Spring 2012.
1 1 Solutions to Exam #1 John H. Vande Vate Fall, 2002.
1 1 Exam I John H. Vande Vate Spring, Question 1 … centers to minimize its total transportation costs from its 2 plants to its 5 markets. We.
1 1 Modeling Flows John H. Vande Vate Spring, 2006.
1 1 Modeling Inventory (Deterministic View) John H. Vande Vate Spring 2007.
1 1 1-to-Many Distribution Vehicle Routing Part 2 John H. Vande Vate Spring, 2005.
1 1 Review of Exam 1 John H. Vande Vate Fall 2009.
1 1 Review of Part I Preparation for Exam John H. Vande Vate Fall 2009.
Spring 02 Vande Vate 1 1 Modeling Service When Transport is restricted to Load-Driven Pool Points in Retail Distribution John Vande Vate Spring.
1 1 Exam 1 John H. Vande Vate Spring, Process 80+ exams to grade Certainly errors, misunderstanding, … Happy to re-grade BUT –Only respond to.
1 1 Practice Final John H. Vande Vate Fall, 2005.
Generated Trips and their Implications for Transport Modelling using EMME/2 Marwan AL-Azzawi Senior Transport Planner PDC Consultants, UK Also at Napier.
Ford Motor Company’s Finished Vehicle Distribution System April 2001 Ellen Ewing Project Director UPS Logistics Dr. John Vande Vate Exec. Director EMIL.
Inventory and Ford’s New Car Distribution zPlants in the East yNorfolk yAtlanta yLouisville ySt. Louis yKansas City zRamps in the West yLaurel yOrillia.
1 1 Milk Runs and Variability John H. Vande Vate Fall, 2002.
1 1 ISyE 6203 Consolidation John H. Vande Vate Spring 2012.
1 1 1-to-Many Distribution with Transshipments John H. Vande Vate Spring, 2001.
1 1 Practice Exam #1 John H. Vande Vate Fall, 2002.
Intermodal Logistics Operation In Ford Otosan, Turkey Recai IŞIKTAŞ Logistics Manager.
Transportation II Lecture 16 ESD.260 Fall 2003 Caplice.
1 1 Modeling Inventory (Deterministic View) John H. Vande Vate Spring 2008.
1 1 Frequency: Inventory vs Transportation John H. Vande Vate Spring, 2007.
Modeling Flows and Information
Review for Exam 2 Pratt & Whitney is preparing to make final arrangements for delivery of jet engines from its final assembly plants to aircraft manufacturers’
Strategic Capacity Management
John H. Vande Vate Spring, 2005
Frequency John H. Vande Vate Fall,
John H. Vande Vate Spring, 2001
Finished Vehicle Distribution System
Many-to-Many Models Multicommodity Flows
John H. Vande Vate Spring, 2007
Transportation Management
Location Case Study Shanghai GM Service Parts Part II
Finished Vehicle Distribution System
Routing and Logistics with TransCAD
Transportation & Supply Chain Costs: Answers to Questions
John H. Vande Vate Spring 2005
Modeling Service When Transport is restricted to Load-Driven
Logistics Systems Analysis Mid-Term Review
John H. Vande Vate Spring, 2008
Project #1 Optimization Model
Vehicle Routing John H. Vande Vate Fall,
Modeling Flows and Information
John H. Vande Vate Spring, 2005
Presentation transcript:

Inventory and Models in Project 3 Load Driven Systems John H. Vande Vate Spring, 2001

Outline What are the inventory implications How to build a model

Inventory Laurel, Montana Orilla, Washington

At the Plants Half a rail car load on average for each ramp Conclusion: Inventory at the origins depends on the capacity of the transportation units and the number of destinations served.

At the Mixing Center Models we have: –In Bound Only (if Out Bound is one-by-one) –In Bound and Out Bound (eg. Case #1) Simplicity of mixing center allows detailed model Model depends on operating policy

Two Operating Policies Minimum Inventory Policy –Whenever there’s a full load to a destination, bring in an empty rail car (if necessary) and haul it away –Requires an inventory of empty railcars Equipment Balance Strategy –Never bring in an empty rail car –Strive to have rail cars arrive full and depart full. –Sometimes, they may depart empty

Minimum Inventory Just like the plant! Expect half a rail car in each load lane Inventory depends on the capacity of the transportation units and the number of destination the mixing center serves Why no dependence on the number of plants the mixing center serves? Why no in-bound inventory?

Building the Lot How many vehicles can there be on the lot? How large must we make it?

Equipment Balance The inventory will slowly rise to a point where we achieve equipment balance and then remain there. A Fiction: –We serve r destination ramps so there are r load lanes –Each rail car holds c vehicles –Suppose each load lane had c-1 vehicles and one load lane, #1, was empty –What happens when the next railcar arrives?

The Fiction If all c vehicles go to load lane #1, we have a full load … If any vehicle goes to another load lane, we have a full load… Can’t haul away more than c vehicles … why not?

Why is this a fiction? Under the equipment balance policy we can have more than c vehicles in a load lane. How? Question: How many vehicles can there be at the mixing center?

An Answer No more than (r-1)(c-1) That’s as though we had one empty load lane and the rest just short of full. Argument: If we have (r-1)(c-1) and c vehicles arrive, then we have r(c-1) + 1. Some load lane must have at least c vehicles.

In Either Case Inventory at the mixing center depends on the capacity of the transportation units c and the number of destinations it serves r.

At the Ramps Inventory at the rail ramp? What does it depend on?

A Basic Model Cont. Variable: path from plant to ramp Examples: –Direct: plant to ramp without visiting mixing center –Mixing center: plant to mc to ramp Binary Variable: on each leg to count dest. –Plant to ramp –Plant to mc –mc to ramp...

Constraints Meet Demand –sum over all the paths out of the plant to a ramp = –demand at the ramp for the plants production. Count the destinations the plant serves – for each path that uses the leg from-to flow on the path  Demand at the destination ramp from the origin plant*binary variable on leg from-to

Complications What should the costs be? Long paths through several mixing centers How do different modes influence the question? –Do unit trains have different inventory influences at the plants and mixing centers than individual rail cars? –What’s the influence of speed? How to model different modes?