Example 6.4 Plant and Warehouse Location Models. 6.16.1 | 6.2 | 6.3 | 6.5 | 6.6 | 6.76.26.36.56.66.7 Background Information n Huntco produces tomato sauce.

Slides:



Advertisements
Similar presentations
Dynamic Workforce Planning Models
Advertisements

Introduction to LP Modeling
A Multiperiod Production Problem
Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Static Workforce Scheduling Models
Example 2.2 Estimating the Relationship between Price and Demand.
DAY 10: MICROSOFT EXCEL – CHAPTER 8 MICROSOFT EXCEL – CHAPTER 9 MICROSOFT EXCEL – CHAPTER 10 Akhila Kondai September 23, 2013.
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
Example 5.6 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 6.1 Capital Budgeting Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven.
Example 14.3 Football Production at the Pigskin Company
Example 4.7 Data Envelopment Analysis (DEA) | 4.2 | 4.3 | 4.4 | 4.5 | Background Information n Consider a group of three hospitals.
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Example 6.2 Fixed-Cost Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Great Threads Company is capable of manufacturing.
Example 12.1 Operations Models: Bidding on Contract.
Example 5.3 More General Logistics Models | 5.2 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 5.5 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 7.1 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n The Madison.
Example 8.7 Cluster Analysis | 8.2 | 8.3 | 8.4 | 8.5 | 8.6 | CLUSTERS.XLS n This file contains demographic data on 49 of.
Example 9.1 Goal Programming | 9.3 | Background Information n The Leon Burnit Ad Agency is trying to determine a TV advertising schedule.
Example 7.6 Facility Location Models | 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information.
Nonlinear Pricing Models
Example 4.4 Blending Models.
 Explore the principles of cost-volume-profit relationships  Perform a basic what-if analysis  Use Goal Seek to calculate a solution  Create a one-variable.
Example 15.2 Blending Oil Products at Chandler Oil
Example 14.1 Introduction to LP Modeling. 14.1a14.1a | 14.2 | Linear Programming n Linear programming (LP) is a method of spreadsheet optimization.
Math Programming Intro to Optimization Modeling, Linear Programming Models, and Network Models.
Linear Programming The Industrial Revolution resulted in (eventually) -- large companies, large problems How to optimize the utilization of scarce resources?
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
COMPREHENSIVE Excel Tutorial 10 Performing What-If Analyses.
Transportation Model Lecture 16 Dr. Arshad Zaheer
Example 12.6 A Financial Planning Model | 12.2 | 12.3 | 12.4 | 12.5 | 12.7 |12.8 | 12.9 | | | | | | |
Tutorial 10: Performing What-If Analyses
Example 7.2 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n We continue.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Example 15.6 Managing Cash Flows at Fun Toys
Integer Programming Models
Optimization Models with Integer Variables
Example 4.5 Production Process Models | 4.2 | 4.3 | 4.4 | 4.6 | Background Information n Repco produces three drugs, A, B and.
The Supply Chain Customer Supplier Manufacturer Distributor
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Example 5.8 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.9 | 5.10 | 5.10a a Background Information.
Chapter 7 Transportation, Assignment & Transshipment Problems
Example 2.5 Decisions Involving the Time Value of Money.
MIS 463: Decision Support Systems for Business Review of Linear Programming and Applications Aslı Sencer.
Appendix B A BRIEF TOUR OF SOLVER Prescriptive Analytics
Transportation and Assignment Problems
Example 15.7 Capital Budgeting at the Tatham Company Integer Programming Models.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
Example 13.6a Houses Sold in the Midwest Exponential Smoothing.
 Review the principles of cost-volume-profit relationships  Discuss Excel what-if analysis tools 2.
Example A Market Share Model | 12.2 | 12.3 | 12.4 | 12.5 | 12.6 |12.7 | 12.8 | 12.9 | | | | | | |
Chapter 4 Linear Programming Models. Example 4.1 – Advertising Model General Flakes Company advertises a low-fat breakfast cereal in a variety of 30 second.
Example 5.10 Project Scheduling Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10a a Background Information.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
Example 3.1a Sensitivity Analysis and Solver Table Add-in.
A Multiperiod Production Problem
DECISION MODELING WITH Prentice Hall Publishers and
Project Scheduling Models
Excel Solver IE 469 Spring 2017.
Excel Solver IE 469 Spring 2018.
Wyndor Example; Enter data
Excel Solver IE 469 Fall 2018.
Linear Programming Excel Solver.
Excel Solver IE 469 Spring 2019.
Presentation transcript:

Example 6.4 Plant and Warehouse Location Models

| 6.2 | 6.3 | 6.5 | 6.6 | Background Information n Huntco produces tomato sauce at five different plants. n The capacity (in tons) of each plant is given in the following table. Capacities for Huntco Example Plant Tons

| 6.2 | 6.3 | 6.5 | 6.6 | Background Information -- continued n The tomato sauce is stored at one of three warehouses. The cost per ton of producing tomato sauce at each plant and shipping it to each warehouse is given in the table shown here. Production and Shipping Costs for Huntco Example To Warehouse 1Warehouse 2Warehouse 3 Plant 1$800$1000$1200 Plant 2$700$500$700 FromPlant 3$800$600$500 Plant 4$500$600$700 Plant 5$700$600$500

| 6.2 | 6.3 | 6.5 | 6.6 | Background Information -- continued n Huntco has four customers. n The cost of shipping a ton of sauce from each warehouse to each customer is given in the table shown here. Shipping Costs to Customers for Huntco Example To Customer 1Customer 2Customer 3Customer 4 Warehouse 1$40$80$90$50 FromWarehouse 2$70$40$60$80 Warehouse 3$80$30$50$60

| 6.2 | 6.3 | 6.5 | 6.6 | Background Information -- continued n Each customer must receive the amount (in tons) of sauce given in the following table. Customer Requirements for Huntco Example Customer 1234 Requirements

| 6.2 | 6.3 | 6.5 | 6.6 | Background Information -- continued n The annual fixed cost of operating each plant and warehouse is listed in this table. Fixed Costs for Huntco Example Fixed Annual Cost Plant 1$35,000 Plant 2$45,000 Plant 3$40,000 Plant 4$42,000 Plant 5$40,000 Warehouse 1$40,000 Warehouse 2$20,000 Warehouse 3$60,000

| 6.2 | 6.3 | 6.5 | 6.6 | Background Information -- continued n Huntco’s goal is to minimize the annual cost of meeting customer demands. n The company wants to determine which plants and warehouses to open, as well as the optimal shipping plan.

| 6.2 | 6.3 | 6.5 | 6.6 | Solution n To model Huntco’s situation we need to keep track of the following: –The shipments from plants to warehouses –The shipments from warehouses to customers –The fixed costs of operating plants and warehouses –The shipping and production costs from plants to warehouses –The shipping costs from warehouses to customers –The total amount shipped out of each plant

| 6.2 | 6.3 | 6.5 | 6.6 | Solution -- continued n We must also ensure that –Huntco pays the fixed costs for all plants and warehouses that it uses. –The amount shipped into each warehouse equals the amount received by each warehouse. –Each customer receives the specified demand.

| 6.2 | 6.3 | 6.5 | 6.6 | HUNTCO.XLS n The spreadsheet model is shown on the next slide. n This file can be used to complete the model.

| 6.2 | 6.3 | 6.5 | 6.6 |

| 6.2 | 6.3 | 6.5 | 6.6 | Developing the Model n To form the model, follow these steps: –Inputs. Enter the given data in the shaded ranges. –Shipments. Enter any trial values for the shipments from each plant to each warehouse in the Shipped1 range and any trial values for the shipments from each warehouse to each customer in the Shipped2 range. –Binary fixed cost variables. Enter any trial 0-1 values for the plant fixed-cost variables in the UsePlants range and the warehouse fixed-cost variables in the UseWhses range. The fixed-cost variable for a plant equals 1 if the plant is used and 0 if the plant is not used. Similarly, the fixed-cost variable for a warehouse equals 1 if the warehouse is used and 0 if the warehouse is not used.

| 6.2 | 6.3 | 6.5 | 6.6 | Developing the Model -- continued –Amount shipped out of each plant. Calculate the amounts shipped out of the plants as row sums in the ShippedOut1 range. Specifically, enter the formula =SUM(B30:D30) in cell E30 and copy it to the rest of the ShippedOut1 range. –Upper limit on amount shipped out of each plant. For each plant we need a constraint of the form Total shipped out of plant  Plant capacity * Fixed-cost variable for plant This inequality ensures that if Huntco uses the plant, then this plant’s fixed-cost variable will equal 1 and the company will have to pay the plant’s operating cost. In this case the inequality states that the total shipped out of the plant is less than or equal to the plant’s capacity.

| 6.2 | 6.3 | 6.5 | 6.6 | Developing the Model -- continued –We generate the right side of the inequality in the UpCounds1 range. Specifically, enter the formula =B21*H6 in cell G30 and copy it to the rest of the UpBounds1 range. Note that if a plant is not used, the Solver is free to make this plant’s fixed-cost variable 0, and no fixed cost for this plant will be incurred. Then the inequality will be satisfied trivially (0  0). –Amount shipped into and out of each warehouse. For each warehouse, we need “flow balance” – that is, we need the following constraint: Total shipments into warehouse = Total shipments out of warehouse To implement this equation, first calculate the left side as column sums in the ShippedIn1 range. That is, enter the formula =SUM(B30:B34) in cell B35 and copy it to the rest of the ShippedIn1 range.

| 6.2 | 6.3 | 6.5 | 6.6 | Developing the Model -- continued –For the right side of the equality, first calculate total shipments out of warehouses as row sums in the ShippedOut2_Col column range. That is enter the formula =SUM(B42:E42) in cell F42 and copying it to the rest of the ShippedOut2_Col range, entering the formula totals in the ShippedOut2_Row row range by selecting this range, entering the formula =TRANSPOSE(ShippedOut2_Col) and pressing Ctrl-Shift-Enter. This allows us to compare a row with a row when we specify the equation in the Solver dialog box. –Upper limit on amount shipped out of each warehouse. For each warehouse we need a constraint of the form Total shipped out of warehouse  UpperBound * Fixed-cost variable for warehouse

| 6.2 | 6.3 | 6.5 | 6.6 | Developing the Model -- continued –Here UpperBound is an upper bound on the most that could possibly be shipped out of any warehouse. Several possibilities for UpperBound could be used. We use the smaller of the total demand for all customers and the total capacity for all plants. If a warehouse’s fixed-cost variable is 0, then the inequality ensures that this warehouse cannot be used, whereas if the fixed-cost variable is 1, then this inequality is satisfied automatically. To operationalize the inequality, note that we already have the left sides in the ShippedOut2_Col range. To calculate the right side, enter the formula =E21*MIN(SUM(Capacities),(SUM(Demands)) in cell H42 and copy it to the rest of the UpBounds2 range.

| 6.2 | 6.3 | 6.5 | 6.6 | Developing the Model -- continued –Amount received by each customer. Calculate the total amounts received by the customers as column sums in the ShippedIn2 range. That is, enter the formula =SUM(B42:B44) in cell B45 and copy it to the rest of the ShippedIn2 range. –Shipping costs. Calculate the total costs of shipping from plants to warehouses and from warehouses to customers in cells B50 and B51 with the formulas =SUMPRODUCT(UnitCosts1,Shipped1) and =SUMPRODUCT(UnitCosts2,Shipped2). –Fixed costs. Calculate the annual fixed costs for operating plants and warehouses in cells B52 and B53 with the formulas =SUMPRODUCT(FCosts1,UsePlants) and =SUMPRODUCT(FCosts2,UseWhses).

| 6.2 | 6.3 | 6.5 | 6.6 | Developing the Model -- continued –Total cost. Finally, calculate the total annual cost in the TotCost cell with the formula =SUM(ShipCosts,FixedCosts).

| 6.2 | 6.3 | 6.5 | 6.6 | Using the Solver n The completed Solver dialog box is shown here.

| 6.2 | 6.3 | 6.5 | 6.6 | Using the Solver -- continued n The following is the explanation of the setup of the previous dialog box. –Objective. The objective to minimize is total annual cost. –Changing cells. There are four sets of changing cells – two sets for amounts to ship and two sets of binary variables for which plants and warehouses to use. –Plant upper bounds. The constraint ShippedOut1<=UpBounds1 operationalizes the first inequality. –Warehouse upper bounds. The constraint ShippedOut2_Col<=UpBounds2 operationalizes the second inequality.

| 6.2 | 6.3 | 6.5 | 6.6 | Using the Solver -- continued –Warehouse balance. The constraint ShippedIn1=ShippedOut2_Row operationalizes the equality. –Demand constraints. The constraint ShippedIn2>=Demands ensures that each customer received the required amount.

| 6.2 | 6.3 | 6.5 | 6.6 | Solution n The optimal solution shown indicates that Huntco should use plants 2, 3, and 5 and warehouses 2 and 3. n Of course, the optimal shipping plan, as specified in the Shipped1 and Shipped2 ranges, uses only these plants and warehouses. n This solution incurs a total annual cost of $700,500. n If you obtain an “optimal” solution with a total cost somewhat larger than this, check the Solver tolerance setting. If it is at its default level of 5%, the Solver might very well stop short of optimal. We obtained our solution by setting the tolerance to 0%.

| 6.2 | 6.3 | 6.5 | 6.6 | Solution -- continued n At this point, you might want to review the inputs for this problem and see whether the optimal solution appears reasonable from an economic point of view. n For example, although plant 1 has a relatively small fixed cost, it has relatively large unit shipping costs. n This is evidently the reason for not using plant 1. n However, the situation is not so obvious for plant 4 or warehouse 1. We think you will agree that on logistics problems such as this – and this is not even a large problem – more than intuition is necessary!

| 6.2 | 6.3 | 6.5 | 6.6 | Sensitivity Analysis n We will not report any specific sensitivity analyses for this model, but many are possible. n For example, we might check whether adding larger capacities at plants 1 and 4 would induce Huntco to open them. n Or we might see what would happen if all the fixed costs increases by some percentage. n Or we might see what would happen if all customer demands increased by some percentage. n SolverTable, after some slight model modifications, can easily analyze any of these situations.