1 / 20

Transportation Problems

Transportation Problems. Dr. Ron Tibben-Lembke. Transportation Problems. Linear programming is good at solving problems with zillions of options, and finding the optimal solution. Could it work for transportation problems? Costs are linear, and shipment quantities are linear, so maybe so.

ura
Download Presentation

Transportation Problems

An Image/Link below is provided (as is) to download presentation 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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Transportation Problems Dr. Ron Tibben-Lembke

  2. Transportation Problems • Linear programming is good at solving problems with zillions of options, and finding the optimal solution. • Could it work for transportation problems? • Costs are linear, and shipment quantities are linear, so maybe so.

  3. Defining Variables • Define cij as the cost to ship one unit from i to j. • Demand at location j is dj. • Supply at DC i is Si • Xij is the quantity shipped from DC i to customer j.

  4. Formulation

  5. Transportation Method You have 3 DCs, and need to deliver product to 4 customers. Find cheapest way to satisfy all demand D 2 A 10 E 4 B 10 F 12 C 10 G 11

  6. Solving Transportation Problems • Trial and Error • Linear Programming – ooh, what’s that?! • Tell me more!

  7. Setting up LP • Create a matrix of shipment costs (in grey in example). • Create a matrix to hold the decision variables, shipment quantities (in yellow). • Sum amount sent to each destination. • Sum amount sent from each DC. • Enter demands and supplies at each location. • Compute total cost of shipments (in blue).

  8. Using Solver

  9. If you don’t check “assume non-negative” we get the following results: • Solver doesn’t converge to an optimal solution. Why not?

  10. Inequalities • Use <= for shipments from DCs. • Use >= for shipments to customers. • Do we really need to? • What do we do if supply is greater than demand?

  11. Product Shortages • If total demand is greater than total supply, what happens? • If demand in G is 15, we get this:

  12. Product Shortages • If demand at G is 15, there are no feasible solutions, much less a best one. • We need to add a phantom source, Z, with huge capacity. Think of it as a supplier that ships empty boxes. • Now supply can satisfy total demand.

  13. Shortage Costs • What cost should we use for supplier Z? • It should be the last resort, so it should be higher than any real costs. • The cost of a shipment from Z is really the cost of shorting the customer. • If all customers are created equal, give them all the same shortage cost. • If some are more important, give them higher shortage costs, and we’ll only short them as a last resort.

  14. Shortage Solution • Shortage is dealt with by shorting customer A, and B. • Demand exceeds supply by 3 units. Our first choice is to short A, because they are the cheapest. We can only short them by 2, their total demand. • Next, short B by 1 unit.

More Related