Transportation Models I INTRODUCTION the transportation problems are one of the types of the LPP, in which objective is to satsport various quantities of a single homogeneous commodity, to different destinations in such a way that the total transportation cost is minimum, stration problems gave ea of distribution policy’ making, where the objective is ninimisation of transportation cost. \The various features of linear programming can be spserved in these problems. Here the #ailability as well as requirements of the various centres tne finite and constitute the limited resources. It is also assumed!that cost of shipping is” near, Thus these problems could also be solved by “Simplex Method”. direct relevance to decisions in the {TERMINOLOGY USED IN TRANSPORTATION MODEL 1. Feasible Solution (FS). Non negative values of xij wherei = 1,2, ......m andj =1, 2, ..... n which satisfy the constraints of availability (supply) and requirement (demand) is called the feasible solution to the transportation problem. 2. Basie feasible solution (BFS). A feasible solution to a m-origin, n-destination problem is said to be basic if the number of positive allocations are m +n-1ie. one less than the sum of rows and columns. } 3. Optimal solution. A feasible solution is said to be optithal if it minimizes the total transportation cost. The optimal solution itself may or lay not be a basic solution. This is done through successive improvements to the i itial basic feasible solution until no further decrease in transportation cost is possible. Balanced transportation problem. A transportation problem in whicl the total supply from all the sources equals the total demand in all the destinations. >“GOL NIOS TeEy Juan ay} aad yor ayy 2 Atpanp epeu ore SUOHE[NTED “wLIoy vinqey v UT poquasardas BEHOCsUeI} OU, “sesnoyarea u pu soLo}OR5 war” aloyy asoddng roe aHL 40 NOILVLNGS3Ud UVINAVL “Al “104M v se LOLESTURBI0 ayy 10y UoTe}IOdsuELy WeAUELTE UE Yons Jo aaqDelqo ayy, “eanOalGO “g “peypyedsap fepuedepuy *p “uze}.189 st axquao uoKdumsuco royjoue 04 Huao woonposd suo wroxy suey Jo 4509 uoHe}odsuey jum red ou, “yRuM sod 3509) “g axqu99 woHdumsuoo Lrax9 0} 23490 uoronpoxd en Woy Poyodsuesy AjuaIuaAuos oq wed suIay] “suIOxT Jo WOTTEIZOdsuEAy, -Z 4800 [B}0} OU} osTUMTUTUE oF st quar unuenb ot Jo Juepuadepur st uorEyzodstes} Jo 3800 yum sad 94,9800 9 “poambor Anuenb = ajqepear Aqjuenb Isf tsi Gq =e “sexqueo uordumsuoo Juasayip Jo uoutasmbax [e40} 07 fenbo st sJodap 410 mos JUOIATp ye UONGLNSTp oy a]quireae KjVUENy “AaHUENb oy Jo ATGETEAY “TL 1A0OW JHL JO SNOILANNSSY DISVa “II ; ‘(SAA voHNIos SUOHTBIOTTE Jo JqUINU oY} JT “(SAAA) VOLNIOS o[qEseay oIseq oFUIOUOTOG “, “(h ‘g) 8e Ua}qLIM ST g 4809 98} YoIya UT auo yy Sf f WUINIOD PUB | MOI Jo HorOasxOqUT Je PEqBOO []99 OUT, 7 L st pucareg, o 1 8 9 a : at z ¥ v squelg ¥ & a t sosnoyazem 3gqjoo ou} uy uopILIAN are syS09 oryIOA ,SUUINYOD, UXO} S99 OSH, “S199, PoyTed me a ur pasn xLgeur 24} UT “ABopouyULIE, XEQUPY “9 5 Awan euoyyepy Xe ot paouepequm pojjes e oad woyyuzA0dsau.y poounyequy “¢ uepeq jou are yorym suIa[qoId YONS cee feet A “Ipequoztroy woz, pur bs ayy ‘ura[qord uorye}.10% Alrorrewayyepy vHadO 261 INHOAL 3AUWLUNYNO ANY HOHVES3H SNO!SI. OPTIMAL SOLUTION OF THE TRANSPORTATION PROBL There are two steps to find the optimal solution of the transportation prob (A) Find an initial basic feasible solution. (B) Obtain an optimal solution by making successive improvements to initial b: feasible solution until no further decrease in the transportation cost is possible, ae a P —_ 2 aan Boo at.CAVA) POUT UoyeUITxoaddy s,Ja30A (D) (poyseW eUNTUTIY XIVeW 10 WOT poy Arquy ysog yamoy (gq) CNOMN) SPOYI] JUIOD ySaA\ YAION (CY) jOyNjos a[qisees [eLyTUr Ue Surdojaagp Jo Spoyzeut yUB}10dur oy} ore SULMOTIOT SNOILN1OS 4191SV34 DISVA TVILINI YOd SAOHLIN “HA I 407 pouruuns oy} 0} jenbe s} spoos Jo yoo4s [e704 oy} yey} SayAydury ugue + Bq + Tq = Map sere 4 Bn 4 Ip “SUOTZ{PUOD oY} OUNSSE OA “(UT ZT = D fod ye poyoedxe spood jo AyryUNNb oy ayouep 'q puw (wee ZT = 2 AW Hod 48 poyeayus9u0s spoos yo ApQUENb oY} J0UEp 04!” osn uRO (“gq Sq ‘Ig Ses) woryeurysop u pus (“ye Sy ‘by Aus) Saoumos ware 0} yt Ae [Bs0ued B UT Wo[qoad UOT17e7A0dsUEAy B YNOGe YUuTY) UES 2M *a70N lOMOUNI OU SOZTUNTUTU 41 18U1 UONS Waisds OU 1O SUOTINTOS AATPAar-TOT nM Aa Aa ae uotExample 1. Solve the following by NWCM. Warehouses Ww, We Ws Supply S; Py Plant Py, Ps Demand D;-” Total cost = 20% 74+ 1X5 + 25x 74+ 2x3 +17KB= F 462 Example 2. Solve the following transportation problem by NWCM To Ww, We We We a From. 40 , Co es 1 20 iz = Fe 20] [26 5 40 oan a 33a] [sz 30 afl Sl 150 ; [6 30 | 160 | 200] 50 | 500Luba Gude Scaaiaeal Example 3. Production, at plant Require- mentNSPORTATION MODELS 205 example 4. Solve the following problem by NWCM {RAI CapacityALAUBPULLALIULL LUBY Wee + eee weuuy ones eres een, Example 5. De Ds Dg Ds Availability 4 6 8 8 20 10 0 5 8 30 11 20 40 3 15 0 9 14 16 13 6 8 18 6 78pueweg Sa fq weld la asnoyore A “9 ajdwexy ‘sUOTJUT}SOp JUaLayIp ye JUsutarIMba.t au W101nau, conditions are satisfied. eae Example 7. Solve the following: transportation problem by ‘Matrix Minima Methog:Example 8. Solve the following thanportition ‘problem by LCEM. Qi Q. Qs Required AlOoOnR! e}m onl OI = Solution.Le Uplinda auUCaMUN Vy WU aN UT OR Na TUR Ue me se Example 9. Solve the following problem with LCEM A B c Dummy W aie = (tele x = 24] b 14 7 17 13 Y t Pe ba 26 W 23) 21 Zz 36 MKT. 76 Require- 18 28 25 ~ ment 4auvar CUSL = Jy) Example 10. Solve the following problem by Least cost entry method. De Ds Ds Ds | Availabili 4 6 8 8 10 0 5 8 11 20 — 40 3 0 9 14 16 6 8 18 6step number (iii). Repeat the procedure until all the column and row totals are satisfied. Example 11. Solve the following transportation problem : [G.N.D.U. 2008 Sept.]Example 12. Destination A I 21 16 Source It 17 18 Tir 32 27\GPORTATION MODELS B 211 example 13. Priyanka Iron & Steel Co. has 3 open health furnaces & 5 rolling Transportation costs (* per Quintal) for transporting steel for furnaces to ain mills are shown in the following table. F, Fp eee eee What is the optimal schedule ? (LC.W.A. Dec., 1986)evry “7809 U1} D}.10dsuD4y asrutUrU OF sasnoyacDM ponpo.d Jo uoingisjsip u0140}.40dsun1y JUIULLaJap OF poyjaui 8,J2804 FursQ < # mojaq uaags $1 xt (U0} 4ad 2) 1809 UOIYD}LOdsUD.1y ayy, ‘dsa4 ¥ OFT 0S ‘09 240 § PUD J sasnoyausnmn ayy 4of (8U0}) ‘bau KpyzUOW ayy, dat 8 08 OI 240 DB g ‘VY (8UO}) Kpavdno UoYoNposd KysyuOW aYT Ss PAD TID hoyasDMn fp on Ayddns ynyn 9 9 g ‘y sa1.0jon{ g spy Cuvdwooa y *p| ajdwexy MINAS ALE RUAN At a ee ee1 maygosd u01qp440dsuD.13 Surnopjof ay, 4Of spoyjzau alip 20.44} ysvaq yo hq UOIENIOS 2]g1SDAf 918Dq 10192U2 ay; Pury “S| ajdwiexywe tet eas AYE OU UU LOLI Ga Ur prustaneecns o- VIII. OPTIMALITY TEST we can proceed to know, whether After computation of an initial basic feasible solution, the solution so obtained is optimum or not. . . Solutions so obtained may be Optimal or may not be Optimal, so it becomes essential fo, us to test for Optimization. For this purpose we first define non-degenerate basic feasible solution. aa, , Basic feasible solution of an (m X n) transportation problem is said to be non-degenerat, if it has following two properties : bei op tar (a) Initial basic feasible solution must contain exactly m + n — 1 number of individual allocations. - (6) These allocations must be in independent positions. Independent position of a set of allocations means that it is always impossible to form any closed loop through these allocations. See figures given below :“ase .oyy{o UT OURS oq [ILA 3[NSOI 943 asnwoag [BL19}BUILU! St U9yfe} JUOUIOAOUL 94} Jo UOrPaLIp aly, (axenbg auIO}] Payfeo St 4]) ‘}82 pardnoooun owres 943 07 youq SuuANyar A{feuy pure s[[oo pardnss0 oa1y) ysvarqe yBnoay} (doo] 40) yyed pasoyo ¥ does) arenbs pasnun papayas ayy YIM SuruutBag (9) “paqenyead aq 0} arenbs pasnun ue qoajag (np) $ saxo][0J Sw payonpUuod St UOLFENTeAD oN, “wra[qoad ayy Jo uorypuoo pueurop pur s{ddns 0} sureyor ey} (doop) yyed pasoyo v Sururz0j Aq apeur st Jaysues} SI, “[]9 patdnovoun ay} 0} [[e9 pardnooo ue Woy qTUN ou FupsasueI} Jo yayo oy3 Joy [[20 patdnovoun [je oyenjeag “g doqg “CAVA 4Atqesajoad) poyjeur Aue Sursn uornjos a[qiseay o1seq [eryrur ue auruNaag *z da4g ‘syuowoanbay wry O43 Ya Suopw woyeysodsuvzy Jo s09 Wun uoard v YIM a[qey UOIeIZOdsuer] B aredaig *T dag :sdos Supmoyjoy ay. Uy pozreurums oq ued AqTeUIYdo oy} Buy}s9} 10y poy au0Ig Bulddayg ayy, Poyiew ou0ig Furddays (y) “worjnjos ay} ur A[juaaino you saynod uoTyeysodsueay BIA spoo8 Sutddrys Jo ssouaarjoayjo 4800 a4} a7eN[RAd oj st YoLosdde sy] 4 YOM poyjauT 9u04s Burddays ay Soop Moy] “yUoMTeAOAduTy a[qIssod 10j UoLNIOS ay} ZuTysoy, “gq “suUIn{od Jo sequinu oy) snyd sMos jo Joquinu ayy Jo uins oy) ueY] ssa] duO 0} [enba aq sexe JsnuL (oenbs 30) soynos pordno00 Jo soquinu oy} ‘9]N4 SIUy UJ “povrosqo oq ysxy ysnuI posn Sutoq soynos Burddrys jo saqunu ay} JNoge o[N OUD ‘wa[qord UOHEI10dsueI} 0 ‘poyyaW aUOIg Buiddayg oy) Atdde 0} Jopx0 UT “UO! NIos aIQISeAy [eUINdo Ue 07 VOLNIos aiqiseay TENTUL ue SULACUE HOA, anbruypoy oarjowso}UI ue st poyjou souoys Suiddoys oy, poyyour au0ys Surddays oy, "Vy -uornyos ojqiseay 1seq [eIITUT uv jo ApTeUUNAdo ayy ssnosip 07 pomoTjoj aIB SpoYoUL OSU, (GOW) Pou YoHNGLySIC PoYyIPoW ‘E “pore OUoyg Buddays “vy “PeMo][oy oe Spoyjour omy osod.nd sty} 10) uosod uapuodapuy : af le ° ° [vowsod jwepuodspun-uoy | doo} pasoig Sa Tt bts ° ° abe S13Q0W NOLWIHOdSN|cH AND QUANTITATIVE TECHNIQUE Ri OPERATIONS RESEA i wed, and therefo - In the closed path formulation of only right angle turn 16 allo re skip t the turning points. Jus (+) and all other cells which are not a Tal At each corner of the closed path assig? J ° beginning with plus sign for the unoccupied we (we The +ve and -ve signs can be assigned either Seals along the closed pat! (d) Compute the net change in cost along the ¢ transportation costs associated with each of the a a ‘tion to cost with the decreases, will be 216 minus (-) sign alternatively ter square) to be evaluated. wise or counter clockwise h by adding together the unit 1] traced in the closed path, he improvement index, Comparing the addi (e) Repeat steps 3 (a) to 3 @) until net change in cost has been calculated for all unoccupied cells. . e f the net change in the unit transportation costs. If al] Step 4. Check the sign of each o} val solution, otherwise go to net changes are plus (-+) or zero, then we step 5. Step 5. Select the unoccupied cell with most negative net change among all unoccupied cells. If two minus values are equal, select that one which will result in moving as many units as possible into the selected unoccupied cell with the minimum cost. Step 6. Assign as many units as possible to unoccupied cell satisfying rim conditions, The maximum number of units to be assigned are equal to the smaller circled number ignoring sign among the occupied cells with minus value in the closed path. Step 7. Go to step 3 and repeat the procedure until all unoccupied cells are evaluated | | and the net change is positive or zero values. Fyamnle 18. Sale the follamning hv NWCM and test its optimality by Stepping have obtained an opti‘eqnoi pasnun 4soq ey} BIA poddrys oq ues yey} S}uN JO Jaquinu uNUEXeW oyy oUTELLEyp 0 sdjay, yyed sry} ‘yowoadde ouo4s Surddoys oy YqEM se ysnf ‘yyed paso? auo Ayu aov1} 0} paitnbad ote am ‘palfiquop! St Xopur jso8.1e] ay} UGC “XOpUl quewoaoidut aaryeSou soe] OY} YPM oyNoL posnun oy} Surpuy Jo suvour Mou B apraoid TGOW -swia[qoad uorey1odsuett Bulaos 10j poyyout ou0}s Buiddoys oy} J0Ao sBuravs auury a[qeLopIsuoo apraoid uayyo uve 41 Sty} Jo asnvaag *(sdool) syyed posojo oy Jo [[e Buyweap ynoyyres aaenbs paserqun yoo oy Apyonb sooIpul yusWsAOIdUN! aINduLOD 07 SN SMOTTY poyjoUr (UOITNGLYSIP Pey!Ppoul) TOW euL (pey19W POW) COHLAW NOILAGINLSIG Galaiaow (A) OSL =OPERATIONS RES At ne ee INNS 226 i ity. The following steps are followed to determine the optimal ee ee Step 1. From the given data construct a transportation table wi gi ion and rim conditions. ope el : : an pep 2. Determine in initial basic feasible solution using a suitable method. (.e, NWC ee Estep ar er the current basic feasible solution with _m + Hic gemumiod cone solely index numbers (dual variables) Rj = (i = 1,,...m)and Kj = (j= 1, 2y-- ctively. : oie oo se nation calube of Ryand K,, the following relationship (formula) for occupied cells is used, oy = Ry + Kj for all i,j ; Step 4. For occupied cells, the opportunity cost by using the formula. dy = oj - Ri + K for all i, j Step 5. Now the opportunity cost ofan unoccupied cell is determined by using the formula; Opportunity cost = Actual cost - Implied cost dy = cy- (Ri + Kj) Step 6. Examine unoccupied cells evaluation for dij : : : (a) If dj > 0, then the cost of transportation will increase, i.e., and optimal solution has been arrived at. : () Ifdj = 0, then the cost of transportation will remain unchanged. But there exists an alternative solution. : a (c) Ifdy < 0, then an improved solution can be obtained by introducing cell (i, j) in the basis and go to step 7. (i.e. next step) Step 7. Select an unoccupied cell (i.e. Water Square) with largest negative opportunity cost among all unoccupied cells, Step 8. Construct a closed path for the unoccupied cell determined in step 7 and assign plus (+) and minus (-) sign alternatively beginning with plus sign for the selected unoccupied cell in clockwise or other direction, Step 9. Assign as many units as possible to the w The smallest allocation in a cell with negative sign on the closed path indi Tom those occupied cells on the path marked with minus signs, Step 10. Go to step 4 and repeat procedure until all dy reached. Calculate the associated total transportation cost. Example 20. Ra/]ninjeer fo 4h eer = 0, ie, an optimal solution isIX DEGENERACY IN THE TRANSPORTATION PROBLEM It may be noted that total number of stone squares must be equal to them + n-1i.e. r' requirement. If this condition is not satisfied the solution is degenerate. Such situation occurs in the following two cases : a8 There may be excessive number of stone squares in a solution than the ri requirements that ism +n-1. This type of degeneracy arises only in developing t initial solution and is caused by an improper assignment or an error in formulati the problem. In such cases there is a need to modify the initial solution so as satisfy the rule of m + n-1 (rim requirements). The second situation occurs when there may be insufficient number of stone squ in a solution. Degeneracy of this type may occur either in the initial solution or i subsequent table. - Ad wa TeedtneSUDSE4QUELIL Lavic, Stage 1. Degeneracy occur at the : This particular case of degeneracy arises when both a column requirement and row requirement are satisfied simultaneously. We introduce greek letter epsilon e in a wate, square with the lowest transportation cost and by this process the number of stone squares becomes equal to the rim requirements and we can proceed to solve the solution in an ordin: , way. The value of Epsilon (¢) is assumed to be something greater than 0 but which does ne affect our mathematical calculation in anyway. Once € is introduced into the solution, it remain there until degeneracy is removed or a final solution is arrived at, whichever oe first. The use of ¢ is illustrated in the following example. iis jnitial solutionStage 2. Degeneracy occurs during the test of optimality Such situation occurs while during the iteration process two stone squares eliminate in one step that is both a column requirement and row requirement are satisfied simultaneously, Degeneracy at this stage can also be resolved by allocating epsilon (¢) to one or more of the recently vacated cells or other vacant cells having least cost value and independent position. The same has been illustrated in the following examples. Eyamnle 24. Find Ontimal calutian to tha fallamina tranenartation nroblem in