* Assigomunt_ Medel * Aci | Job 78 : Note: Cquore radon x only] oR add dummy Glumn os RO aa tre squae Yeabox4 tlungaaian method/ % /eduted Matsx method /Floode kehnigue + Cost table 1 eNpEcteat Fo Be Squog, of wike add duromy Rnd/ colurnn. unth cast So - Row treatrrunt— Srratueat element ia gubhra ted from each mond Column tarotmunt — Smaliesd eliment i subtracted from Rad olerrurd Moke axsvqn ment in Gost ~=matsx agasnst Lore Zn tht manmun number | axigrnenvte Qownb > tide al) unatrignecl vows Dif a sow ja ticked 5 hos a Aro, ihren auK the Comes ponding column 2) 4 a G@iumo re ee oy hag an - eclies then “ees Ke correaponding- 1 peak 2,3 HK) 90 move ee je Pacsible, 5S) Draw lines though unh cked Rows and Hukad columns. the aumbea {lines ea the UANIMUM Number aurgnnunndts Pele.ahd lines paaes hrro ugh a _ Subhud @ if no lines — pastes throw i : Sr -Volur 4 & 38 ah oninimume Oru he pl ea ge BF 10 IF 10 OSEON Ea Jom iV em ION im 13 tf 1S Wy ie ro 1S 16 19aa t Blo] 3 fle] s be se] @ | 4 s~ —fe}}-O-+-$2 + 6-0. solide | ae ve YW aa A | yet 2) O=)- 0) (O— Thdking He unaxngned Rows - (D — Ticking the wee Colum , which has 20 Value in uenasss gyred yIWS. AY — tcking tow, Dhich hos asélgmned Draw \mes dam unkidd Rows 4 cktd —columac ie witee: ig 2 tines passes 3 Sublercr og if noe line pasa 1 fiw Dive woPal cost = Cast* Special (ar » Maxim zation Aisign mek fra buenas tonya JE 40 mini mizaK orm pabuin. + Unbalanced mesignnuartt Fhoblem : Add dummy Rov] cdumn te foo A Square nasa » Prohibited Aen gna: geen ea ae o qaavellio J Salesman = CON K oe? -Sau=man sho yore unh) he abe "No awignmunt howd be rude along the diagana wd not vigit tHe a ho. visita all)g A wom pany ha iS a team of fous salesmen and there a8 fous aarids whya thy wmpeny wonts tb start +3 business - Apter taking int> oreeut the copabili hes of Sadesmen and the wt of dightichs, the compar eghmates that the prpt por doy in Mupees nm cous salesman i woth divide a8 below ?- pis cb ae See C 8 s | a a rai 2 acl find te oe salesmen do various distids waturch wit) gia maximum — pryitnsor2017 Hungeran method Print This Solution Close This Sol jon of Assignment problem using Hungarian method 1 |i |m}iv A 16| 10] 14] 11 B 14] | 1515 c 15|15} 13] 12 D 13] 12| 14] 15 Sol ‘The number of rows = 4 and columns = 4 Jala [a |v] . Here the problem is of Maximazition type and convert it into minimization by substracting it from maximum value 16 Heil ez ene ee Here given problem is balanced. Step-1: Find out the each row minimum element and subtract it from that row aboutblank7noo17 Hungarian method ‘Step-2: Find out the each column minimum element and subtract it from that column, fm a qv | SSS [sla] e 0) 0) | 9) | (0) | ‘Step-3: Make assignment in the opporunity cost table (1) Rowwise cell (A, 2) is assigned, so columnwise cell (C, I) crossed off. @) Rowwise cell (C, 17) is assigned (3) Rowwise cell (D, ZV) is assigned, so columnwise cell (B, IV) crossed off (4) Columnwise cell (B, ITZ) is assigned Rowwise & columnwise assignment shown in table I Wr) wv Step-4: Number of assignments = 4, number of rows =4 ‘Which is equal, so solution is optimal Optimal assignments are |z ea Vv A|(@ || 6 | 2 [6 | 4 | | « Optimal solution is aboutblank 23inonoi7 Work | Job | Cost Solution is provided by AtoZmath.com aboutblank Hungaan method* Travelling Sgleeman Probum * (shorkat Cyuie Route Models) A saleeman wank ¢> Visit ciha 12, & and 4, He dred not want to visit any hy quai lo Befeee com pug _ te tour | alu the cikes and wishes ty sutim to hie home dty, the Ba recrat cope) going. from +o anothir in eu pees fe oe dG qin 0 table Find dhe leash cost soute To uty ee 1} (30 | 8r|2 ay From 2 uy 3| 4 S)o-— AS from dy I>), 22. ok. ke nop gong allowte, — atsign a Tonge analy Ste “Diagonal darmunk = “Perfor Row & column dicadment »Fup ta Bll Slele Biv 3al(O[$ [- Pials AS esis Th f ° > ‘Ae the dxavelling- salesman obem given-- d nes Qy = 20 C1324 y= IO fone SF Cay = 6 10 Cae 6 Cug = 20 whut ay= Gi faye A thie ig no seoute blo abies i4j ip value pos cy not shownSubWraching 9=3 Wo wip He Subtya ching Q=) au lial ey] BEG) a Dn to phe iS] Pe s@ fe |— rat olt fo-fef— ofa le [tb -@> |e +10 [fel late [Ee eels | , I F@l/4 at aaa ° : y e Y = : alate ® alia ch) % Subtroanng 92 hs a © rpeepe fi tosJ— : 12 || 0 | & | [) [C9 i l=[e]o [+ B [?lolefe fe et $ ea} 8 eo} (i) Le b 5 6 =r are sy ghee is 90 mw os Colymo 2 ic ly withoud osignment, ophma 2 | assignment B possi ple in ke ae 4% IT ef wren sivhey elyeri feu || 193, 394, 47), violake TSP. cen Bye} Zi Gry DAS OM uNnwoverd. cy NOt einium qun-ZLeo domunt 13 1 i et od =4 19324 a=G> 6.) 272rs \ soi = 0] 17S = 10 | o>4 =20 Suk. h>\ £10 4SL A daa welling gakaman sas do visit five che. He wishee +0 Stast from oo parhudak diy, visit each aly once and then yew yo his stavting- print « the ta velling- cost af each cy from a paxhcular dty is given below To aty ks © fe A eo 2 5 + 1 1 B we 3 2@ 2 Froro iE s . city Ce neo a + | D i ale le|s E ) Ce re ie oad What is tm sequnu 4 visit of she salesman go that the cost 18 Minimum.THor017 ‘Tayeling salesman problem Print This Solution Close This Solution Find Solution of Travelling salesman problem work’? | A |B]C|D)E A x [2[s|7|i B 6 |x |3 [8 |2 ie a [7[x[4|7 D 12[4]o[x|s E 1 [3 [2 [8 ]x Solution: ‘The number of rows Step-l: stand subtract it from that row ox Step-2: Find out the each column minimum element and subtract it from that column, [ra fee tee |p |e] aboutblankrn07017 Traveling salosman problem [elo [2 fo mac & | GD | | 6 Iteration-1 of stpes 3 to 6 Step-3: Make assignment in the opporunity cost table (1) Rowwise cell ‘(A,B)’ is assigned, so columnwise cell'(B,E)-0" crossed off (2) Rowwise cell (B,C) is assigned, so columnwise cell (E,C)=0" erossed off. (3) Rowwise cell (C.D) is assigned (4) Rowwise cell (D,By' is assigned (5) Rowwise cell (E,A)’ is assigned Rowwise & columnwise assignment shown in table wl eel Dl Ee] ‘Step-4: Number of assignments = 5, number of rows = 5 ‘The solution gives the sequence : “A-DE,E>A’ ‘The above solution is not a solution to the travelling salesman problem as he visits each city only once. Iteration-2 of sipes 3 to 6 ‘The next best solution can be obtained by bringing the minimum non-zero element, i., | into the solution, ‘The cost 1 occurs at 3 places. We will consider all the cases separately until the acceptable solution is obtained. Case: 1 of 3 for minimum non-zero element 1 ‘Make the assignment in the cell (A,B) and repeat Step-3. Step-3: Make assignment in the opporunity cost table (1) Rowwise cell (A,BY' is assigned, so columnwise cell “(D,B) (ABO crossed off 2) Rowwise eell (C.D) is assigned G) Columnwise cell (E,AY is assigned, so rowwise cell “(E,C)=0" crossed off. (4) Rowwise cell (B,E) is assigned, so columnwise cell "(D,E)=I° crossed off. _boutblank 2sioreat7 ‘Traveling salesman problem (5) Rowwise cell (D,C)' is assigned, so columnwise cell \(B,C)=0" crossed off. ~ step-4: Number of assignments = 5, number of rows = The solution gives the sequence : “A->B,B->E,E>A° ‘The above solution is nota solution to the travelling salesman problem as he visits each city only once. Iteration-3 of stpes 3 to 6 Case: 2 of 3 for minimum non-zero element 1 Make the assignment in the cell “(D,C)’ and repeat Step-3. ‘Step-3: Make assignment in the opporunity cost table (1) Rowwise cell (D.C) is assigned, so columnwise cell (B,C}=0","(E,C)=0", (D,B)°0", (D,E)=1" crossed off. (2) Rowwise cell (B,E)’ is assigned, so columnwise cell ‘(A,E)=0 crossed off. (3) Rowwise cell (C,D)' is assigned (4) Rowwise cell (E,A)’ is assigned (5) Columnvvise cell (A,B) is assigned Rowwise & columnwise assignment shown in table Tal Bcc | > le | Step-4: Number of assignments = 5, number of rows = 5 about blank 35702017 Traveling salesman problem ‘The solution gives the sequence : “A>B,B>EE>A’ ‘The above solution is not a solution to the travelling salesman problem as he visits each city only once. eration-4 of sipes 3 to 6 Case: 3 of 3 for minimum non-zero element 1 ‘Make the assignment in the cell “(D,E)’ and repeat Step-3. ‘Step-3: Make assignment in the opporunity cost table (1) Rowwise cell “(D,E)" is assigned, so columnwise cell '(A,E)-0","(B,E)=0", (D1 J=1" crossed off, (2) Rowwise cell (A,B) is assigned (3) Rowwise cell ‘(B,C)’ is assigned, so columnwise cell (E,C)=0" crossed off. (4) Rowwise cell (C.D) is assigned (5) Rowwise cell "(E,A)’ is assigned Rowwise & columnwise assignment shown in table Tale |e |p |e wa[u[a{sle«|x) wlalmimls« |x! cou 3 [mio] 3 D> x|xi{uMig E 2 | xl 7 | ™M | Step-4: Number of assignments = 5, number of rows = 5 ‘The solution gives the sequence : “A>B,B->C,C>D,D->E,E->A So solution is optimal Optimal assignments are wi Ble DLE om [mia] 3 [6] x] Mio] 6) « 3 f/ulm|3 | }xlxi[ulm|_ 2a poe | rae aa jeer aboutblank 45ror017 Traveling salesman problem ‘Optimal solution is Work | Job | Cost Total | 15 Solution is provided by AtoZmath.com 56 aboutblankSolve tht travelling Calaman problem with =a the Plowing doko : =3 C= 4 Gas F Cie Be osc 6 Say cet and cys Gi SP" = FGM given data, the Allowing ask mabix Can ve desived: 2 ' & 2 jo[4 [2 |? wai} 61 * pares | ae 2 + 6 & Siac ase Pejreming., Ry txeatment Column A3eod ment \ Den ey) a\1 \4)\0 \ 1 0 : oO ) oe ol ols | § lu FrFwPr —mor17 Print This Solu Traveling salosman problem Close This Solution Find Solution of Travelling salesman problem work? | A]B]C|D A x {4}7 43 B 4 |x |6|3 c 716 |x|7 D3 |3|7[x Solution: ‘The number of rows = 4 and columns = 4 B\|c|D 3 3 Here given p Step-1: Find oblem is balanced. cout the each row minimum element and subtract it from that row 0) || 6) aboutblank 18rHoro17 “Traveling salesman problem Ieration-1 ofsipes 3 10 6 Step-3: Make assignment in the opporunity cost table (1) Rowwise cell (A, Djs assigned, so columnwise cell (B, D) (2) Rowwise cell (B, Os assigned ) Rowwise cell (C', BYs assigned, so columnwise cell (D, B) = @rossed off. (4) Rowwise coll (D, As assigned Rowwise & columnwise assignment shown in table A Blalp] ‘Step-4: Number of assignments = 4, number of rows =4 The solution gives the sequence: A D,D -» A ‘The above solution is not a solution to the travelling salesman problem as he visits each city only once. eration-2 of spes 3 10 6 ‘The next best solution can be obtained by bringing the minimum non-zero element, ie. | into the solution. ‘The cost 1 occurs at 6 places. We will consider all the eases separately until Case: 1 of 6 for minimum non-zero element 1 Make the assignment in the cell (A, B)and repeat Step-3. Step-3: Make assignment in the opporunity cost table (1) Rowwise cell (4, BY assigned, so columnwise cell (C, B) = 1D, B) = {(4, C) = XA, D) = Grossed off. (2) Rowwise cell (B, D)is assigned, so columnwise cell (C, D) = krossed off. ) Rowwise cell (C, A)is assigned, so columnwise cell (B, A) = 1D, A) = Qrossed off. (4) Rowwise cell (D, Cis assigned, so columnwise cell (B, C) = @rossed off. Rowwise & columnwise assignment shown in table c|m) x | M| x aboutblank the acceptable solution is obtained. 28mor017 Traveling salesman problem D coe M ‘Step-4: Number of assignments = 4, number of rows = 4 The solution gives the sequence : A ~> B, B-+ D,D-¥C,C +A So solution is optimal (Optima esgnments are lo 42337) ce yf bx «a Optimal solution is Work | Job | Cost | a | T | Total) 21 Solution is provided by AtoZmath.com ‘aboutblank