420 likes | 457 Views
ISyE 6203: Transportation and Supply Chain Management. XYZ Company Supply Chain Optimization Project Network Optimization. Prepared By: Jayson Choy Christie Williams Andy Ang Thomas Ou Naragain Phumchusri Raghav Himatsingka. Date: 04/25/2006. Agenda. Introduction Key Deliverables
E N D
ISyE 6203: Transportation and Supply Chain Management XYZ CompanySupply Chain Optimization ProjectNetwork Optimization Prepared By: Jayson Choy Christie Williams Andy Ang Thomas Ou Naragain Phumchusri Raghav Himatsingka Date: 04/25/2006
Agenda • Introduction • Key Deliverables • Data Analysis • Mathematical Model • Recommendation • Sensitivity Analysis • Conclusion
Introduction • Locations in Florida and California • Each location has Multiple Operations • Suppliers across USA • Supplier shipments may be parcel, less-than-truckload or full truckload, some must be frozen or chilled Project goal: Reduce inbound transportation costs across the business while meeting customer service requirements.
Timeline Phase Jan Feb Mar Apr Project kick-off & Deliverables Rationalization Data Cleansing & Validation Preliminary Modeling Validation of Model Generation of results & sensitivity Analyses
Agenda • Introduction • Key Deliverables • Data Analysis • Mathematical Model • Recommendation • Sensitivity Analysis • Conclusion
Key Deliverables • Create a graphic illustration of Current North American Supply Chain network • Document Current Volumes and Freight spend by mode to each location and in total • Identify and recommend North American Consolidation Points for most efficient route and capacity utilization • Create a graphic illustration of the Recommended New Supply Chain Network with all consolidation facility representations and conceptual lanes to each location
Problem Definition Florida
Problem Definition 13% LTL: Greatest Opportunity for Savings 8% 36% 11% 6% 26%
Problem Definition • Focus on Consolidation of LTL shipments to Florida • Eliminated Frozen and Chilled shipments from the Optimization model • Included most FTL shipments by breaking them down
Agenda • Introduction • Key Deliverables • Data Analysis • Mathematical Model • Recommendation • Sensitivity Analysis • Conclusion
Agenda • Introduction • Key Deliverables • Data Analysis • Mathematical Model • Recommendation • Sensitivity Analysis • Conclusion
Supplier Locations (LTL Florida)(Data Aggregation by 3-Digit Zip Code)
LTL LTL LTL FTL LTL LTL LTL LTL LTL LTL LTL To Consolidate LTL Shipments into FTL Present Situation Shipper Shipper CP Shipper Shipper Proposed Solution XYZ Company
Proposed 2-Step Model To Generate Potential Consolidation Point Candidates Step 1: Set Covering Model (SCM) Step 2: Network Design Model (NDM) To Determine which Consolidation Points to Open/ Close
Step 1: Set Covering Model (SCM) • Integer Programming Model • Model will decide 30 Potential Consolidation Points within 300 mile Radius • from Suppliers. • Maximize sum(i in Suppliers) y[i] • s.t {sum(i in Suppliers) x[i] <= 30; forall(i in Suppliers) • y[i] <= (sum(j in Suppliers) Matrix[i,j]*x[j]) To Maximize the Number of Suppliers which can be Covered by the CPs To Generate at most 30 Potential CP locations To Ensure that CPs are within 300 mile radius from Suppliers
SCM Results: 30 Consolidation Points Next Step: CP Candidates will be fed into the Network Design Model (NDM)
Step 2: Network Design Model (NDM) • Model Objectives : • To Decide which Consolidation Points to open or close • To Determine whether Suppliers should Ship Direct to the company • To Assign Suppliers to Consolidation Points To Open or Close? To Open or Close? To Open or Close? To Open or Close? To Open or Close? To Open or Close? To Open or Close? To Open or Close? To Open or Close
Objective : To Minimize Total Transportation Costs (Direct shipments + Shipments via opened CP) • Constraint I: If Supplier is not a Candidate CP • We either serve this 3 Digit zip via LTL shipments to the • destination or via a consolidation point LTL Shipment CP Shipper Direct LTL Shipment XYZ Company
FTL CP LTL Step 2: Network Design Model (NDM) Constraint II: If Supplier is a Candidate CP • Case 1: If NOT OPEN We send LTL direct or via a designated CP Case 1 XYZ Company CP
FTL Step 2: Network Design Model (NDM) Constraint II: If Supplier is a Candidate CP • Case 2: If OPEN We consolidate at CP and send FTL direct Case 2 XYZ Company CP
0.8 * Step 2: Network Design Model (NDM) Constraint III: Load Factor of 0.8 • Total Inflow into CP < = [ 0.8 * Total Truckloads ] LTL LTL CP LTL ie at least 1 truckload per week Constraint IV: Frequency • Minimum Truckloads going through an Open CP per year > = 52
Agenda • Introduction • Key Deliverables • Data Analysis • Mathematical Model • Recommendation • Sensitivity Analysis • Conclusion
Cost Savings 8% Reduction Less than 8% Reduction
Agenda • Introduction • Key Deliverables • Data Analysis • Mathematical Model • Recommendation • Sensitivity Analysis • Conclusion
Agenda • Introduction • Key Deliverables • Data Analysis • Mathematical Model • Recommendation • Sensitivity Analysis • Conclusion
Conclusion • Key Learning • Counter intuitive peculiarities of LTL cost structure (small volumes, backhauling …etc) • Moving Forward • “Milk run” study on remaining LTL direct volumes • Optimization of other shipment modes (e.g. parcel, frozen, chilled …etc) • Optimization of Florida bound shipments