Dy OR Transportation Technique S. Transportation Problems (Transportation Problem: The Objecive in these prob single homogeneous comm number of. destinations) that the destination’s dem; bution origins and that th, S are parti Teme : a Class of; allocation Problems. odity thes i“ ‘ansport various amounts of a re Stored at several Origins, toa 1on is effected in s : uct ied wit odie The transportati ‘ands are satisfj i € total transpo) thin the capacity of distri- Cost is a minimum.) ' Concern has ‘mm’ a cities in India. There are ‘n reall shops in odin‘ ferent country which can absorb all the Products stored, Thee cities of the tion problem is to determine the transportation schedule on transporta- the total cost of transporting the mam minimises plants to various retail shops: factured produts from various The name “Transportation problems, is derived from transport to which it was first applied. But the Transportation technique is applicable tovother problems also, for example: Machine allocation, product mix etc. Transportation techniuque can be applied not only to the cost minimising problems, but also to time-minimising problems, distance minimising problems, profit maximising problems, etc tation Transportation Table Denote the origins as O,, Os, ..... O,, and destinations as D,, D,, D,. Let the quantity produced at the origins be respectively yy Ag, vveees a, Let the requirements in various destinations be respectively bj, by, vee Dy. The total quantity produced and total os required must be equal iea,;+a)+..... =b,+b,+......b,or La= Lb. a Let be the cost of transportation of one unit from the ‘i’th origin ‘o ‘}'th destination. | . These information can be presented in a matrix form as:Available a a Required trix ig known aS Transportation table or Cost effectiy, This mat (rotalavailable)= = b (Total required) manne nee js to determine the quantity X;; to be transported g, \e prol F : zy the *? the origin to ‘j’ th destination such that the total cost ij Xr, isminimum. ; Be tation problem in the form of a L.P-P. (Mathematica} formu, ‘Transpor oe x, be the number of units transported from «pth origin toy destination. Cj be the cost for transporting one unit from ‘i’ origi ginty ‘jvhdestination. Let ‘a betheunits available in ‘i"* origin and ‘bj bei, units required in ‘j’ destination. Then the problem is. tha Minimise Z= 2 | 52) Cixi : i : Subjectto ,», xj=a,fori=1,2,.. Fs : © x=, forj=1,2, Xj 2 Ofori,j Basic assumptions in Transportation Technique 1. La xb; . That is, total quantity available for distributions eqal to total requirement in different destinations together. 2 The unit transportation: cost from one origin to a destination S Certain. 3. The unit cost is independent of the quantity transported. Objective is to minimise the total transportation cost.D3 pees of Transportnion tectinigue To minimise transpory “portation 1 H arehou from warehouses to. markets from factories to 5 Todetermine To determine ses OF 1 ae Cost location for new factory. um Cost production schedule. DEFINITIONS Feasible Solution: A feasible solution to a transportation problem is 3 get of Non Negative individual allocati ‘ i yw ani A locations wt tisfy the ro column sum restrictions. floms walen sat Therefore, for feasibility, the sum of the allocations in the rows must be equal to the availability in that row. Similarly sum of the allocations in the columns must be equal to the demand in that column. Basic feasible Solution: A feasible solution to a mx n transportation roblem is said to be a basic feasible solution if the total number of allocations is exactly equal tom+n-—1, Optimal Solution: A feasible solution (Basic or not) is said to be optimal if it minimises the total transportation cost. Non degenerate basic feasible solution: A feasible solution ofamxn transportation problem is said to be non degenerate basic feasible solu- tion if ‘i (1) the number of allocations is equal tom+n-1 Q) the allocations are in independent positions. i Loops in transportation table (Non - independent position) Allocation are said to be in independent positions, if it is impossible to increase or decrease any allocation without either changing the posi- tion of the allocation or violating the rim requirements. Therefore when the allocations are in independent positions, it is impossible to travel from any allocation back to itself through a series of horizontal or vertical jumps. For example: TableI Table II Table IIT 2 Ez : cree s| 3/2] |5 2 3 3 4|:7)2 7 4 7) 3 In the table I, the allocations are in independent positions. In table Mand III they are not in independent position.yt . ppoblem Steps for solving a Transpo tnt! fh mv’ rows representin, 1 Set up a transportation ie destinations oe Orig, and ‘nh’ columns represe? oe in to the problem my Develop an initial feasib e solu on or not & Test whether the solution is optty ‘ha alfocatlone 4 Ifthe solution is not optimal Mor te a S$ Repeat steps 4 and 5 until an optimal solution is obtained, NOTE. If there are “1” spaces), Each cell is and the other represent cell falling in the secon Initial basic feasible solution : Initial feasible solutions are those which satisfy the rim regy; ment. That is, the allocations made in every Tow taken together pie that row. Similarly for each column, thet tal to the availability shown in allocation should be equal to the requirement jn that column. The initial solution can be obtained either by inspection or by go : me rules. The commonly used methods for finding initial soluti uti North west corner rule (2) Lowest cost entry method (matrix are (I method) (3) Vogel’s approximation method (Unit cost penalty ripe ese columns, there will be ‘mn’ cell o numbers one representing the (o Tow CANS the rows and ‘n’ known by tw ing the column. For example, cell (2, 3) m drow and third column.