Presentation is loading. Please wait.

Presentation is loading. Please wait.

Spring 2015 Mathematics in Management Science Transportation Problems Tableaus Shipping Solutions NorthWest Corner Rule Stepping Stone Algorithm.

Similar presentations


Presentation on theme: "Spring 2015 Mathematics in Management Science Transportation Problems Tableaus Shipping Solutions NorthWest Corner Rule Stepping Stone Algorithm."— Presentation transcript:

1 Spring 2015 Mathematics in Management Science Transportation Problems Tableaus Shipping Solutions NorthWest Corner Rule Stepping Stone Algorithm

2 Transportation Problems Problems where group of suppliers must meet the needs/demands of a group of users of these supplies. (Think corporate sized users, not individuals.) Have cost associated with shipping from a particular supplier to particular “consumer”. Objective is to minimize total shipping cost.

3 Example The military buys fuel from many refineries, and needs to it delivered to multiple bases.

4 Example During World War II, supplies needed to be shipped from multiple US ports to many different European ports. (This is the origin of these types of problems.)

5 Example A supermarket chain buys bread from a supplier that makes its bread in multiple bakeries. The bread must be shipped from individual bakeries to individual stores.

6 Bakery Example Chain gets bread deliveries from a bakery chain that does its baking in different places. Each store needs certain number of loaves/day. Supplier bakes enough to exactly meet demands. How many loaves ship (b to s) to stay within the demands and to minimize the cost?

7 Transportation Problems Have suppliers, users, shipping costs. Each supplier has a fixed amount that they can supply. Each user has a fixed amount they need/demand. The total capacity of the suppliers exactly matches the needs of the users.

8 Transportation Problems Inputs: individual capacities of the suppliers, individual needs of the users, and shipping costs from any one supplier to any one user. This information is collected in a table called a tableau.

9

10 Transportation Problems Have suppliers, users, shipping costs. Tableau: displays info with rim conditions. Each cell has two entries: costs and amount to ship. Shipping solution: obeys all constraints. NorthWest Corner Rule: an algorthim for obtaining a shipping solution. Indicator Values. Stepping Stone Algorithm.

11 Mines & Plants Two mines (extract/supply ore) and three plants (process/demand ore). Mine A supplies 7 m tons, B 3 m tons. Plant 1 needs 2 tons, 2&3 each 4 tons. Shipping costs are from A to P1,P2,P3 --- 7, 1, 3 from B to P1,P2,P3 --- 9, 5, 12

12 Tableaus The tableau is a table with one row per supplier (mines—labeled with A,B) and one column per consumer/demander (plants—labeled with 1,2,3).

13 Plant 1 Plant 2 Plant 3 Mine A Mine B Suppliers on left; demanders on top. Next add rim conditions: Supply amounts in last column. Demand amounts in last row. Check that amounts agree!

14 Plant 1 Plant 2 Plant 3 Mine A 7 Mine B 3 24410

15 Plant 1 Plant 2 Plant 3 Mine A 7 Mine B 3 24410 Next add shipping costs. Cell (m,p) is cost to ship from mine m to plant p.

16 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

17 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410 Need shipping solution to start with.

18 NorthWest Corner Rule Locate top far-left-hand cell. Ship via this cell with smaller of the two rim cells (call the value s) ; circle entry in tableau. Cross out row or column with rim value s, & reduce other rim value for this cell by s. When a single cell remains, shud be tie for rim conditions of row and column involved; put this amount into cell and circle.

19 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410 Here!

20 Plant 1 Plant 2 Plant 3 Mine A 713 5 2 Mine B 95 12 3 24410

21 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 4 Mine B 95 12 3 24410

22 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 41 Mine B 95 12 3 3 24410

23 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 41 Mine B 95 12 3 3 24410 Cost=14+4+3+36=57

24 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 41 Mine B 95 12 3 3 24410 Check Indicator Values

25 Example A supermarket chain has three stores. Their bread supplier makes their bread in three bakeries. The stores require 3 dozen, 7 dozen, and 1 dozen loaves of bread. The bakeries are able to produce 8 dozen, 1 dozen, and 2 dozen loaves. Note: (Needs) 3 + 7 + 1 = 11 = 8 + 1 + 2 (Supplies) The tableau will be a table with one row per supplier (bakeries) labeled with Roman numerals and one column per consumer (stores) labeled with Arabic numerals.

26 Tableau The tableau for this problem is the following: Stores 2 13 Ba k e ri e s I 893 8 II 15112 1 III 135 2 371 Each square is called a cell and the top-right corner of each cell shows the shipping cost for the given supplier → user.

27 Stores 2 13 Ba k e ri e s I 893 8 II 15112 1 III 135 2 371 Cells are labeled by row and column: e.g., I-2 or III-1. Shipping costs are per unit (here 1 dozen loaves). The numbers along the bottom are the needs of the corresponding users. (Store 2 needs 7 doz.) The numbers along the right are the capacities of the corresponding suppliers. (Bakery III can supply 2 doz.) Collectively the numbers along the bottom and right are called the rim conditions.

28 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 41 Mine B 95 12 3 3 24410 Check Indicator Values

29 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 41 Mine B 95 12 3 3 24410

30 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 41 Mine B 95 12 3 3 24410

31 Plant 1 Plant 2 Plant 3 Mine A 713 1 2 14 Mine B 95 12 3 3 24410

32 Plant 1 Plant 2 Plant 3 Mine A 713 1 34 Mine B 95 12 3 21 24410

33 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

34 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

35 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

36 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

37 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

38 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

39 Plant 1 Plant 2 Plant 3 Mine A 713 7 Mine B 95 12 3 24410

40

41 Plant 1 Plant 2 Plant 3 Mine A 316 5 Mine B 523 4 Mine C 178 1 12710

42 Plant 1 Plant 2 Plant 3 Mine A 316 5 Mine B 523 4 Mine C 178 1 12710

43


Download ppt "Spring 2015 Mathematics in Management Science Transportation Problems Tableaus Shipping Solutions NorthWest Corner Rule Stepping Stone Algorithm."

Similar presentations


Ads by Google