1 Transportation Network Optimization Project GPRE Inc. Group Members: Aditya Nambiar, Anuj Gandhi, Ashwin Mishra, Daksh Sabharwal, Graham Thomas, Sandeep.

Slides:



Advertisements
Similar presentations
Network Models Robert Zimmer Room 6, 25 St James.
Advertisements

Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Tier III: Optimization Design Problems Derek McCormack Section 1: Sample Problems.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Transshipment Problem
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
Linear Programming Models & Case Studies
1 1 BA 452 Lesson B.2 Transshipment and Shortest Route ReadingsReadings Chapter 6 Distribution and Network Models.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Chapter 10, Part A Distribution and Network Models
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Transportation, Assignment, and Transshipment Problems
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Solusi Model Transportasi dengan Program Komputer Pertemuan 13 : Mata kuliah : K0164/ Pemrograman Matematika Tahun: 2008.
Linear Programming Example 5 Transportation Problem.
BA 452 Lesson B.1 Transportation 1 1Review We will spend up to 30 minutes reviewing Exam 1 Know how your answers were graded.Know how your answers were.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
Transportation and Assignment Problems
IEOR 180 Senior Project Toni Geralde Mona Gohil Nicolas Gomez Lily Surya Patrick Tam Optimizing Electricity Procurement for the City of Palo Alto.
Linear Programming (6S) and Transportation Problem (8S)
1 Lecture 2 & 3 Linear Programming and Transportation Problem.
INTRODUCTION TO LINEAR PROGRAMMING
Linear Programming Applications
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Network Flows Based on the book: Introduction to Management Science. Hillier & Hillier. McGraw-Hill.
Network Models II Shortest Path Cross Docking Enhance Modeling Skills Modeling with AMPL Spring 03 Vande Vate.
A GAMS TUTORIAL. WHAT IS GAMS ? General Algebraic Modeling System Modeling linear, nonlinear and mixed integer optimization problems Useful with large,
Linear Programming Chapter 13 Supplement.
Kerimcan OzcanMNGT 379 Operations Research1 Transportation, Assignment, and Transshipment Problems Chapter 7.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: Applications Chapter 4.
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Linear Programming: Basic Concepts
1 1 Slide Transportation, Assignment, and Transshipment Professor Ahmadi.
1 Minimum Cost Flows Goal: Minimize costs to meet all demands in a network subject to capacities (combines elements of both shortest path and max flow.
Chapter 7 Transportation, Assignment, and Transshipment Problems
To accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Fourth Edition  1996 Addison-Wesley Publishing Company, Inc. All rights.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Network-Based Optimization Models Charles E. Noon, Ph.D. The University of Tennessee.
Network Optimization Problems
November 5, 2012 AGEC 352-R. Keeney.  Recall  With 2000 total units (maximum) at harbor and 2000 units (minimum) demanded at assembly plants it is not.
作業研究 Using Excel to Formulate and Solve Transportation Problems.
Transportation Problems Dr. Ron Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding the.
Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 7 Business Analytics with Shipment Models Business Analytics with Management.
DISTRIBUTION AND NETWORK MODELS (1/2)
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
1 1 Solutions to Exam #1 John H. Vande Vate Fall, 2002.
IE 311 Operations Research– I
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Transportation, Assignment, and Transshipment Problems Pertemuan 7 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
8/14/04J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 5 – Integration of Network Flow Programming.
Chapter 8 Network Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Optimization and Lagrangian. Partial Derivative Concept Consider a demand function dependent of both price and advertising Q = f(P,A) Analyzing a multivariate.
SUPPLEMENTAL READING: CHAPTER 5.3 AND 5.4 Overheads 4 Different types of LP Formulations Part 1: The Transportation Model The Feed Mix Model 1.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
Dikos, George, and Stavroula Spyropoulou
Lecture 5 – Integration of Network Flow Programming Models
Lecture 5 – Integration of Network Flow Programming Models
Routing and Logistics with TransCAD
Transportation, Assignment and Network Models
Constraint management
Network Models Robert Zimmer Room 6, 25 St James.
Chapter 6 Network Flow Models.
Slides by John Loucks St. Edward’s University.
Chapter 9: Introduction to JADE Case Study
Presentation transcript:

1 Transportation Network Optimization Project GPRE Inc. Group Members: Aditya Nambiar, Anuj Gandhi, Ashwin Mishra, Daksh Sabharwal, Graham Thomas, Sandeep Prakash

2 2 Overview

3 Goal: Develop a tool in Gurobi to optimize transportation network for minimizing weekly freight costs Problem Formulation Operational Implementation Financial Benefits Adding Value Truck Premium Discussion

4 4 Problem Formulation

5 Rates[plant][destination][rail_road] = Rates for transport from plant to destination through a particular rail road/route Min Cars [plant][destination][rail_road] = Min Cars in a plant Max Cars [plant][destination][rail_road] = Max Cars in a plant Demand [load_no][destination][rail_road] = Demand at a destination Carb_Int [plant] = Carbon Intensity for a plant Carb_Int [destination] = Carbon Intensity for a destination FOB = Flag denoting Shipment is FOB or not Parameters: Problem Formulation

6 Problem Formulation - Model Variable: Car_Quant [load_no][plant][destination][rail_road] = No. of cars from a plant to destination through a particular rail road for a load no. Objective Function: Minimize Sum (over load_no, plant, destination, rail_road) { Rates[plant][destination][rail_road]* Car_Quant [load_no][plant][destination][rail_road] }

7 Constraints: For meeting the customer demand for all individual destinations… Sum (over all plants, rail_road) { Car_Quant [load_no][plant][destination][rail_road] } = Demand [load_no][destination][rail_road] Minimum cars out of plants requirement… Sum (over load_no, plant, rail_road) { Car_Quant [load_no][plant][destination][rail_road] } > = Min Cars [plant][destination][rail_road] Maximum cars out of plant requirement… Sum (over load_no, plant, rail_road) { Car_Quant [load_no][plant][destination][rail_road] } <= Max Cars [plant][destination][rail_road] 7 Problem Formulation - Constraints

8 FOB constraint: Here sum of quantity going from plants of a particular FOB region should be equal to demand of the load_no for the customer… if (FOB){ Sum (over plants, rail_road) { Car_Quant [load_no][plant][destination][rail_road] } = Demand[load_no][destination][rail_road] } Carbon intensity constraint: Carbon intensity of the plant sending the shipment should be less than or equal carbon intensity requirement of the destination Sum (over plant, rail_road) {Carb_Int [destination] * Car_Quant [load_no][plant][destination][rail_road] >= {Car_Quant [load_no][plant][destination][rail_road] * Carb_Int [plant] } Problem Formulation - Constraints

9 Mock Nominations Constraint: Here sum of quantity going to destinations of a particular destination region should be equal to demand of the load_no for the customer… If (Region) { Sum (over plants, rail_road, destination) { Car_Quant[load_no][plant][destination][rail_road] } = Demand [load_no][destination-region][rail_road]} Non-Negativity and Integer constraints Car_Quant [load_no][plant][destination][rail_road] are positive integers Problem Formulation - Constraints

10 Optimization Tool

11 Inputs – Shipments & Origin Threshold Output – Optimized Shipments Optimization Tool - Input / Output

12 Operational Implementation To be used weekly once to optimize delivery of shipments Integrated with ShipXpress where user enters shipment data and min-max for plants Users will use the tool via ShipXpress to determine the optimum amount to be sold in Spot Market opportunity

13 Destination Carbon Intensity

14 Cost Comparison: Financial Benefits Net Weekly Savings: $40,000

15 Origin Transportation Costs

16 Scalability –Feature to incorporate Carbon Intensity for All locations –Number of Plants/Destinations can be increased –Provision to increase number of carriers to four Mock Nominations –Gives optimal destination to ship in a region Value Additions

17 Suggestions Location parameters should be consistent across all tables to get best results Incorporating Spot Market / Truck Premium opportunity in the tool

18 Current Model w/o Truck Premium Plants P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 Min-Max Rail Cars

19 Transportation Cost - Premium Plants P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 New Min-Max Optimized Rail Cars

20 Spot Price:0.8 Truck Rate in terms of Rail Car:1000 Truck Premium Demand:6 Plants P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 Cost New Min- Max Spot Price - Cost Premium Quantity q1 q2 q3 q4 q5 q6 q7 q8 q9 q10 Premium Cost 0.7*q1 0.69*q2 0.71*q3 0.7*q4 0.65*q5 0.6*q6 0.55*q7 0.66*q8 0.63*q9 0.61*q10 Comprehensive Model including Costs

21 Cost per Plant 0.1*Q *Q1 0.11*Q *Q2 0.09*Q *Q3 0.1*Q *Q4 0.15*Q *Q5 0.2*Q *Q6 0.25*Q *Q7 0.14*Q *Q8 0.17*Q *Q9 0.19*Q *Q10 Total Cost 0.1*Q *Q *q1 + q1* *Q *Q *q2 + q2* *Q *Q *q3 + q3* *Q *Q *q4 + q4* *Q *Q *q5 + q5* *Q *Q *q6 + q6* *Q *Q *q7 + q7* *Q *Q *q8 + q8* *Q *Q *q9 + q9* *Q *Q *q10 + q10*1000 Comprehensive Model including Costs Contd. Constraint: 1. qi <= spot-market demand near each plant 2. All qi’s are Non-negative

22 Thank You!

23 Questions