Fuzzy Transportation Problem Using Triangular Membership Function-A New approach
|
|
- Melinda Walton
- 6 years ago
- Views:
Transcription
1 Vol3 No.. PP 8- March 03 ISSN: 3 006X Trasportatio Proble Usig Triagular Mebership Fuctio-A New approach a S. Solaiappaa* K. Jeyaraab Departet of Matheatics Aa UiversityUiversity College of Egieerig Raaathapura Tail Nadu Idia solaipudur@yahoo.co.i b DeaSciece ad Huaities PSNA college of Egieerig ad Techology Didigul 646 Tail Nadu Idiajaya_jaaki07@yahoo.co.i Abstract I this Paper a Trasportatio Proble is ivestigated usig Triagular ebership fuctio. vogel s approxiatio ethod is used to obtai iitial basic feasible solutio ad optiu solutio is obtaied usig fuzzy odified distributio ethod. The ethod is illustrated by a exaple. Key Words: triagular fuzzy ubers fuzzy triagular ebership fuctio fuzzy Vogel s approxiatio ethod fuzzy odified distributio ethod. I. INTRODUCTION The trasportatio proble is a special class of liear prograig probles. I a typical proble a product is to be trasported fro several sources to uerous locatios at iiu cost. Suppose that there are warehouses where a coodity is stocked ad trasported to arkets where it is eeded. Let the availability i the warehouses be a a...a ad the s at the arkets be b b...b respectively. I additio there is a pealty c associated with trasportig uit of product fro the source i to the destiatio j. This pealty ay be the cost or delivery tie or safety of delivery etc. A variable x represets the ukow quatity to be shipped fro the source i to the destiatio j. The basic trasportatio proble was origially stated i [4 ad later discussed i [7. A liear prograig proble usig L-R fuzzy uber was give i [9 a operator theory of paraetric prograig for Geeralized Trasportatio Proble (GTP) was preseted by [. I [ the cocept of decisio akig i fuzzy eviroet is proposed ad i [3 the situatio where all the paraeters are fuzzy is cosidered. I [5 H.Isera itroduced a algorith for solvig this proble which provides a effective solutio based o iterval ad fuzzy coefficiets. Further developet o Triagular ebership fuctios i solvig Trasportatio proble uder fuzzy eviroet had bee elaborated by [4 0. This paper is orgaized as follows; i sectio () soe basic defiitios o fuzzy set theory are listed. I sectio (3) the ethod of fuzzy odified distributio to fid out the optial solutio for the total fuzzy trasportatio of iiu cost is discussed. I Sectio (4) a uerical exaple is worked out. II. FUZZY BASCIS.. Defiitio [ If X is a collectio of objects ad a fuzzy subset A of X is a set of ordered pairs. i.e. A (x A(x) / x X where A ( x ) is called the ebership fuctio for the fuzzy set A.The ebership fuctio aps each eleet of X to a ebership grade (or) ebership value betwee 0 ad.. Defiitio [8 The cut (or) - level set of fuzzy subset A is a set cosistig of those eleets of the uiverse X whose ebership values exceed the threshold level. i.e. A x / A ( x).3. Defiitio [8 It A triagular fuzzy uber is represeted with the three poits as A ( a a.a 3 ). This represetatio is iterpreted as ebership fuctio ad holds the followig coditios (i) a to a is icreasig fuctio (ii) a to a3 (iii) a a a3 0 x a a a A ( x) a3 x a3 a 0 is decreasig fuctio for x a for a x a for a x a3 for x a3 8
2 Vol3 No.. PP 8- March 03 ISSN: 3 006X.3 [8 =[ = [ be two triagular fuzzy ubers the the arithetic operatio is } [ = {i( : } + = {[ ) + [ + [ + = {[ [ ax( ).4Defiitio (i) feasible solutio: If x 0 which satisfies the row ad colu su is a fuzzy feasible solutio. (ii) basic feasible solutio: A feasible solutio is a fuzzy basic feasible solutio if the uber of o-egative allocatio is atost (+-) where is the uber of rows ad is the uber of colus i the trasportatio table. (iii) o-degeerate basic feasible solutio: A feasible solutio to a trasportatio proble cotaiig origis ad destiatios is said to be fuzzy o-degeerate if it cotais exactly (+-) occupied cells with o zero values. (iv) degeerate basic feasible solutio: If a basic feasible solutio cotais less tha (+-) o-egative allocatio it is said to be degeerate. III. FUZZY TRANSPORTATION PROBLEM: Cosider a Trasportatio proble with fuzzy origis (row) ad fuzzy destiatios (colus).let c [ c c c is the cost of trasportatio oe uit of the product fro ith fuzzy origi to jth destiatios = [ be the quatity of coodity at fuzzy origi i = [ be the quatity of coodity required at fuzzy destiatios j X is quatity trasported fro ith fuzzy origi to jth fuzzy destiatios. The liear prograig odel represetig the Trasportatio proble is give by i z [ c c c [ X X X Subject to the costraits [ =[ [ =[ For i= 3... rows For j = 3... colus for all X 0 the give fuzzy trasportatio proble is said to be balaced if ai b j. 3.Solutio of Trasportatio Proble: The Solutio of FTP ca be solved i two stages. (i) Iitial Solutio (ii) Optial Solutio. For fidig the iitial solutio of FTP fuzzy Vogel s approxiatio ethod is preferred over the other ethods. Sice the iitial fuzzy basic feasible solutio obtaied by this ethod is either optial (or) very closed to the optial solutio. We are goig to discuss fuzzy Vogel s approxiatio ethod ad verify its solutio i the ature of fuzzy triagular ebership fuctio. 3. Vogel s Approxiatio Method Algorith: Step (i). Fid the fuzzy pealty cost aely the fuzzy differece betwee the sallest ad ext sallest fuzzy costs i each variable i each row ad each colu. Step (ii). Aog the fuzzy pealties foud i step (i) choose the fuzzy axiu pealty by rakig ethod. If this axiu pealty is attaied i ore tha oe cell choose ay oe arbitrary. Step (iii). If the selected row (or) colu by step (ii) fid out the cell havig the least fuzzy cost by usig the fuzzy rakig ethod. Allocate to this cell as uch as possible depedig o the fuzzy capacity ad fuzzy s. Step (iv). Delete the row (or) colu which is truly exhausted. Agai copute colu ad row fuzzy pealties for the reduced fuzzy trasportatio table ad the go to step (i) Repeat the procedure util all the s are satisfied. Oce the iitial fuzzy feasible solutio is coputed the ext step i the proble is to deterie whether the solutio obtaied is optial or ot. optiality test ca be coducted to ay fuzzy iitial basic feasible solutio of a fuzzy trasportatio proble provided such allocatio has exactly ( + -) o-egative allocatio where is the uber of fuzzy origis ad is the uber of fuzzy destiatios. These allocatio cells are idepedet. The optiality procedure is give below 3.3 Modified Distributio Method: This proposed ethod is used for fidig the optial basic feasible solutio i the fuzzy eviroet ad the followig step by step procedure is used to fid out the sae. 9
3 Vol3 No.. PP 8- March 03 ISSN: 3 006X Step. Fid out the set of fuzzy triagular Table 4. The basic fuzzy trasportatio proble [ui ui ui ad [vi vi vi for each ubers D D capacity [ui ui ui + O [-0 [0 [-0 [0 [vi vi vi = [ c c c for each occupied cell. [0 O [48 [470 [46 [46 [46 [468 [468 [470 [468 [04 row ad colu satisfyig To start with we assig a fuzzy zero to ay row (or) colu havig axiu uber of allocatios. If this axiu uber of allocatios is ore tha oe choose ay oe arbitrary. Step. For each epty (uoccupied) cell fid [ui ui ui ad [vi vi vi i = [ c c c - [ui ui ui + [vi vi vi. uique solutio exists. (b) if Z 0 the solutio is optial but a alterate solutio exists. (C) if Z 0 the solutio is ot fuzzy optial. Step 5. The above step yields a better solutio by akig oe (or) ore occupied cell as epty cells. For the ew set of fuzzy basic feasible allocatio repeat fro step till a fuzzy optial basic feasible solutio is obtaied 4.Nuerical Exaple To solve the followig fuzzy trasportatio proble of iial cost we start with the iitial fuzzy basic feasible solutio obtaied by Vogel s Approxiatio ethod for which fuzzy cost ad fuzzy requireet table is give below the give proble is balaced fuzzy trasportatio proble ad the supply ad costs are syetric fuzzy triagular ubers (FTN). j j = [6 6 = [3 9 =33 capacity [-0 [0 [46 [468 [-4 [46 [-35 [468 [-406 [04 D D O [-0 [0 [0 [-0 O [48 [470 [46 I this case we go to ext step to iprove the solutio ad iiize the cost. path drawig horizotal ad vertical lies with corers beig occupied cells. Assig sigs positive ad egative alteratively ad fid out the fuzzy iiu allocatio cell havig egative sig. This allocatio should be added to the allocatio of the other cells havig egative sig. i the proble is balaced fuzzy trasportatio proble. There exists a fuzzy iitial basic feasible solutio. Table 4. It represets the iitial basic fuzzy feasible solutio by VAM ethod This step gives the optiality: (a) if Z 0 the solutio is optial ad a Step 4. Select the epty cell havig the ost o egative value Z fro this cell we draw a closed a b Sice Step 3. Fid out for each epty cell the et evaluatio; [ z z z [470 Sice the uber of occupied cell is +- = 6 ad the occupied cells are idepedet. The iitial solutio is a o-degeerate fuzzy basic feasible solutio. Therefore the iitial fuzzy trasportatio iiu cost is [ z z z = [ (I) 4.3Movig to the optial solutio: Here C are fuzzy cost coefficiet ad X (i = 3 j = 34) are fuzzy allocatios. We have to fid fuzzy ebership fuctios of C ad X for each cell (i j).the ebership trasportatio cost C ( x ) fuctio of fuzzy is foud as follows x 0 0 x 0 C ( x) x x To copute the iterval of cofidece for each level the triagular shapes will be described by fuctios of i the followig aer 0 [468
4 Vol3 No.. PP 8- March 03 ISSN: 3 006X ( x 0) x ( x ) x C [ x x [ (i) Here The ebership fuctios of fuzzy allocatio to the cell () X ( x ) as follows x 0 X ( x ) 0 x 0 x x ( x 0) x Here (x ) x X [ x x [ (ii) Fro (i) ad (ii) we get C X [ ( ) (A) Exactly i the siilar way C 3 X 3 [( )(4 3) (6 )(5 4 ) (B) C4 X 4 [( ) (5 ) (C) i. cos t. Z x ). 8 {( 8 ) 4 ( 7 X )} / 56 / 66 {(66 ) 40 (66 X )} 70 7 x 3 3 x 69 This is the required fuzzy ebership fuctio of fuzzy trasportatio iiu cost Z (usig the equatio uber ). 4.4 Deteriatio of fuzzy optial solutio: Applyig the fuzzy odified distributio ethod we deterie a set of triagular fuzzy ubers [ui ui ui ad [vi vi vi each row ad colu such that [ c c c = [ui ui ui + [vi vi vi for each occupied cell. Sice the 3rd row has axiu uber of allocatio we give [u3 u3 u3 = [- 0. The fuzzy uber reaiig ubers ca be obtaied as give by: [ v v v = [3 4 5 [ v v v = [3 6 7 [ v 3 v 3 v 3 = [3 6 7 [u u u = [-5-3. [v4 v4 v4 = [- 0 [ u u u = [-7-5- We fid for each epty cell the su of [ui ui ui C 3 X 3 [( )( ) (5 )(6 ) ad [vi vi vi (D) Next the et evaluatio of [ z z z are foud C 3 X 3 [( 4)(3 ) (8 )( 4 3 ).Usig the table below: (E) C33 X 33 [( 4)(4 4) (8 )(6 6 ) Table 4.5 It represets the uoccupied cells D D O [-0 *[-6-8 [0 [ X 0 O [48 *[-466 [470 *[-63 [-0 *[-8-6 [46 [ X 0 [46 [468 [-4 [468 [-406 [ (F) A +B+C+D+E+F gives the iiu cost: Z [ (II) Solvig the equatios: (G) We get (H) [ 8 {(3) 4( 7 X )} / 56 [66 {( 66 ) 40 (66 X )} / 70 capacit y [-0 [0 *[040 [4 6 [470 *[363 Sice [ z z z >0 the solutio is fuzzy optial ad uique. Miiu cost of FTP is [ z z z [ [46 8
5 Vol3 No.. PP 8- March 03 ISSN: 3 006X Applied Matheatical Sciece Vol.6 () (0) pp55. Usig exactly i the sae procedure as i the fuzzy iitial basic feasible solutio. We could fid fuzzy ebership fuctio of optial solutio. V. CONCLUSION I this paper we obtaied a optial solutio for Trasportatio Proble of iial cost usig Triagular Mebership Fuctio. The ew arithetic operatios of Triagular fuzzy ubers are eployed to get the fuzzy optial solutios. The optial solutio obtaied by usig the fuzzy odified distributio ethod ca also be verified i the Triagular Mebership Fuctio. This would be a ew attept i solvig the Trasportatio Proble i fuzzy eviroet. I our future extesio we would like to utilize the ew optiizatio techiques i the literature. Aticipatig the valuable coets ad suggestios [9 A. Nagoor Gai C. Duraisay ad C. Veeraai A Note o liear Prograig proble usig L-R fuzzy uber Iteratioal joural of Algoriths Coputig ad Matheatics vol. (3)(009). [0 P. Stepa Dlaagar K. Palaivel O Trapezoidal Mebership Fuctio i solvig trasportatio proble uder fuzzy eviroet Iteratioal Joural of Coputatioal Physical Scieces vol (3) (009) pp93. REFERENCES [ V. Balachadra G.L.Thopso A operator theory of paraetric prograig for the geeralized trasportatio proble: I Basic Theory 975 Nav. Res. Log. Quart [ R.E. Bella L.A. Zadeh Decisio akig i a fuzzy eviroet Maageet sci.7 (970) pp 4-64 [3 S. Chaas D. Kuchta iteger trasportig proble sets ad systes 98(998) pp 9-98 [4 F.L.Hitchock Distributio of product fro several sources to uerous localities Joural of Math Physics.vol. No.3 (978). [5 H. Isera The eueratio of all efficiet solutio for a liear ultiple- objective trasportatio proble Naval Research Logistics Quarterly 6 (979) pp.3-73 [6 L.V. Katrovich O the Traslocatio of asses Doklerdly Akad Nauk SSR vol.37 (94) pp7. [7 C.Koopas Optiu utilizatio of the trasportatio syste Ecooetrica vol.7 suppleet 949 [8 A.Nagoor Gai S.N.Mohaed Assarudee A New Operatio o Triagular Nuber for Solvig Liear Prograig Proble
Method for Solving Unbalanced Transportation Problems Using Trapezoidal Fuzzy Numbers
Kadhirvel. K, Balauruga. K / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.ijera.co Vol., Issue 4, Jul-Aug 0, pp.59-596 Method for Solvig Ubalaced Trasportatio Probles Usig
More informationT. Leelavathy and K. Ganesan
Iteratioal Joural of Scietific & Egieerig Research, Volue 6, Issue 3, March-2015 252 A Optial Solutio of Fuzzy Trasportatio Proble T. Leelavathy ad K. Gaesa Abstract - I this paper, we preset a ethodology
More informationSuperiority of Graph Theoretic Approach to Vogel s Approximation Method in Solving Unbalanced Transportation Problem
Iteratioal Joural of Scietific ad Iovative Matheatical Research (IJSIMR) Volue 6, Issue 5, 2018, PP 19-29 ISSN No (Prit) 2347-307X & ISSN No (Olie) 2347-3142 DOI: http://dxdoiorg/1020431/2347-31420605003
More informationFuzzy Approach to Replacement Problem with Value of Money Changes with Time
Iteratioal Joural of Coputer Applicatios (0975 8887) Volue 30 No.0, Septeber 0 Fuzzy Approach to Replaceet Proble with Value of Moey Chages with Tie Praab Biswas Assistat Teacher Sardaga High School P.O.
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationAn Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem
Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationAustralian Journal of Basic and Applied Sciences, 5(11): , 2011 ISSN On tvs of Subdivision of Star S n
Australia Joural of Basic ad Applied Scieces 5(11): 16-156 011 ISSN 1991-8178 O tvs of Subdivisio of Star S 1 Muhaad Kara Siddiqui ad Deeba Afzal 1 Abdus Sala School of Matheatical Scieces G.C. Uiversity
More informationInternational Journal of Mathematics Trends and Technology (IJMTT) Volume 52 Number 9 December 2017
Iteratioal Joural of Mathematics Treds ad Techology (IJMTT) Volume 5 Number 9 December 7 Optimal Solutio of a Degeerate Trasportatio Problem Reea.G.patel, Dr.P.H.Bhathawala Assistat professor, Departmet
More informationA Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem
P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : 2248-9622, Vol. 4, ssue 3( Versio 1), March 2014, pp.897-903 RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationGRADIENT DESCENT. An aside: text classification. Text: raw data. Admin 9/27/16. Assignment 3 graded. Assignment 5. David Kauchak CS 158 Fall 2016
Adi Assiget 3 graded Assiget 5! Course feedback GRADIENT DESCENT David Kauchak CS 158 Fall 2016 A aside: text classificatio Text: ra data Ra data labels Ra data labels Features? Chardoay Chardoay Piot
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationA NEW RANKING APPROACH AND ITS APPLICATION TO SOLVING FUZZY CRITICAL PATH PROBLEMS. P. Kaur 1* & A. Kumar 2
NEW NKING PPOCH ND ITS PPICTION TO SOVING FUZZY CITIC PTH POBEMS P. Kaur * &. Kuar School of Matheatics ad Coputer pplicatios Thapar Uiversit Patiala Idia parpreetsidhu@gail.co; ait_rs_iitr@ahoo.co BSTCT
More informationHere are the coefficients of the terms listed above: 3,5,2,1,1 respectively.
*. Operatios with Poloials: Let s start b defiig soe words. Ter: A ter is a uber, variable or the product of a uber ad variable(s). For eaple:,, z, a Coefficiet: A coefficiet is the ueric factor of the
More informationGRADIENT DESCENT. Admin 10/24/13. Assignment 5. David Kauchak CS 451 Fall 2013
Adi Assiget 5 GRADIENT DESCENT David Kauchak CS 451 Fall 2013 Math backgroud Liear odels A strog high-bias assuptio is liear separability: i 2 diesios, ca separate classes by a lie i higher diesios, eed
More informationCSE 5311 Notes 16: Matrices
CSE 5311 Notes 16: Matrices STRASSEN S MATRIX MULTIPLICATION Matrix additio: takes scalar additios. Everyday atrix ultiply: p p Let = = p. takes p scalar ultiplies ad -1)p scalar additios. Best lower boud
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationConstraint Cellular Ant Algorithm for the Multi- Objective Vehicle Routing Problem
JOURNAL OF SOFTWARE, VOL. 8, NO. 6, JUNE 03 339 Costrait Cellular At Algorith for the Multi- Objective Vehicle Routig Proble Yuazhi Wag Geography Departet, Dezhou Uiversity, Dezhou, Shadog 5303, Chia Eail:
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationEVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS
Kragujevac Joural of Matheatics Volue 43(3) (019), Pages 47 441. EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS A. LOURDUSAMY 1 AND F. PATRICK 1 Abstract. Let G be a graph with p vertices
More informationOPC Server ECL Comfort 210/310 OPC Server
OPC Server Descriptio j l j o j l k j l j Modbus-RS485 k Etheret or Iteret l Modbus-TCP ECL Cofort cotroller Heat eter o SCADA server The Dafoss is a OPC-copliat server that serves data to OPC cliets.
More informationAssignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters
Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios,
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationMULTIPLE CRITERIA FUZZY COST TRANSPORTATION MODEL OF BOTTLENECK TYPE
Assoiate Professor Alexadra TKACENKO PhD Departet of Applied Matheatis Moldova State Uiversity Moldova E-ail: alexadrataeo@gail.o. MULTIPLE CRITERIA FUZZY COST TRANSPORTATION MODEL OF BOTTLENECK TYPE Abstrat.
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More informationApplication of Type II Kernelized Intuitionistic Fuzzy C Mean in the field of image segmention of MRI image
Iteratioal Research Joural of Egieerig ad Techology (IRJET) e-issn: 395-0056 Volue: 05 Issue: 07 July 08 www.irjet.et p-issn: 395-007 Applicatio of Type II Kerelized Ituitioistic Fuzzy C Mea i the field
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationGeM-Tree: Towards a Generalized Multidimensional Index Structure Supporting Image and Video Retrieval
Teth IEEE Iteratioal Syposiu o Multiedia GeM-Tree: Towards a Geeralized Multidiesioal Idex Structure Supportig Iage ad Video Retrieval Kasturi Chatterjee ad Shu-Chig Che School of Coputig ad Iforatio Scieces
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationEvaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps
Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,
More informationThe golden search method: Question 1
1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationMathematical Stat I: solutions of homework 1
Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationUnicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation
c 21 IEEE. Persoal use of this aterial is peritted. Perissio fro IEEE ust be obtaied for all other uses, i ay curret or future edia, icludig 1 repritig/republishig this aterial for advertisig or prootioal
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More informationHigh-Performance Matrix-Vector Multiplication on the GPU
High-Perforace Matrix-Vector Multiplicatio o the GPU Has Herik Bradeborg Sørese Iforatics ad Matheatical Modellig, Techical Uiversity of Deark, Bldg., DK-8 Lygby, Deark hhs@i.dtu.dk http//www.gpulab.i.dtu.dk
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationInvestigation of the Non-local Means Algorithm
EECS 556 Project: Fial Report Ivestigatio of the No-local Meas Algorith Britta Farer, Aru Sudar Govidaraja, ad Raj Tejas Suryaprakash Itroductio Iage deoisig has bee a subject of iterest i the field of
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationCAMERA CALIBRATION TECHNIQUES USING MULTIPLE CAMERAS OF DIFFERENT RESOLUTIONS AND BUNDLE OF DISTANCES
Iteratioal Archives of Photograetry Reote Sesig ad Spatial Iforatio Scieces Vol. VIII Part 5 Coissio V Syposiu Newcastle upo Tye UK. 1 CAMERA CALIBRATION TECHNIQUES USING MULTIPLE CAMERAS OF DIFFERENT
More informationInteger Feasibility of Random Polytopes
Iteger Feasibility of Rado Polytopes Karthekeya Chadrasekara School of Egieerig ad Applied Scieces Harvard Uiversity karthe@seasharvardedu Satosh S Vepala School of Coputer Sciece Georgia Istitute of Techoy
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationMULTIBEAM SONAR RECORDS DATA DECIMATION USING HIERARCHICAL SPLINE INTERPOLATION JERZY DEMKOWICZ
MULTIBEAM SONAR RECORDS DATA DECIMATION USING HIERARCHICAL SPLINE INTERPOLATION JERZY DEMKOWICZ Gdask Uiversity of Techology Narutowicza 11/12, 8-233 Gdask, Polad dejot@eti.pg.gda.pl Multibea soar records
More informationThe Graphs of Polynomial Functions
Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where
More informationCompactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More informationSpace-Memory-Memory Architecture for Clos-Network Packet Switches
Space-Meory-Meory Architecture for Clos-etwork Packet Switches Xi Li, Zhe Zhou ad Mouir Hadi Departet of Coputer Sciece Hog Kog Uiversity of Sciece & Techology Clear Water Bay, Hog Kog Eail: {lixi, cszz,
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationOutline. M/M/m Queue. Analysis of M/M/m Queue. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 23
EEC 686/785 odelig & Perforace Evaluatio of Couter Systes Lecture Deartet of Electrical ad Couter Egieerig Clevelad State Uiversity webig@ieee.org (based o Dr. Raj Jai s lecture otes Outlie Review of lecture
More informationAbstract Syntax Trees. AST Data Structure. Visitor Interface. Accept methods. Visitor Methodology for AST Traversal CS412/CS413
Abstract Syta Trees CS412/CS413 Itroductio to Copilers Ti Teitelbau Lecture 12: Visitors; Sybol Tables February 18, 2005 Separate AST costructio fro seatic checkig phase Traverse the AST ad perfor seatic
More informationIMPLEMENTATION OF FLOATING POINT MAC USING RESIDUE NUMBER SYSTEM
Joural of Theoretical ad Applied Iforatio Techology th April 4. Vol. 6 No. 5-4 JATIT & LLS. All rights reserved. IMPLEMENTATION OF FLOATING POINT MAC USING RESIDUE NUMER SYSTEM DHANAAL R, SARAT KUMAR SAHOO,,
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationRecursive Procedures. How can you model the relationship between consecutive terms of a sequence?
6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationPhysics 30 Lesson 12 Diffraction Gratings
Physics 30 Lesso 2 Diffractio Gratigs I. Poisso s bright spot Thoas Youg published the results fro his double-slit experiet (Lesso ) i 807 which put the wave theory of light o a fir footig. However, so
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationOn Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets
Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationMinimum Spanning Trees
Presetatio for use with the textbook, lgorithm esig ad pplicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 0 Miimum Spaig Trees 0 Goodrich ad Tamassia Miimum Spaig Trees pplicatio: oectig a Network Suppose
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationMinimum Spanning Trees. Application: Connecting a Network
Miimum Spaig Tree // : Presetatio for use with the textbook, lgorithm esig ad pplicatios, by M. T. oodrich ad R. Tamassia, Wiley, Miimum Spaig Trees oodrich ad Tamassia Miimum Spaig Trees pplicatio: oectig
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More informationIntroductions to Pochhammer
Itroductios to Pochhaer Itroductio to the factorials ad bioials Geeral The factorials ad bioials have a very log history coected with their atural appearace i cobiatorial probles. Such cobiatorial-type
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION
I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated
More informationStrong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More information