A Critical Path Problem Using Intuitionistic. Trapezoidal Fuzzy Number

Similar documents
Realistic Method for Solving Fully Intuitionistic Fuzzy. Transportation Problems

10 D. Chakraborty, D. Guha / IJIM Vol. 2, No. 1 (2010) 9-20

The Modified Heinz s Inequality

New Expansion and Infinite Series

The Shortest Confidence Interval for the Mean of a Normal Distribution

QUADRATURE is an old-fashioned word that refers to

IJESRT. Scientific Journal Impact Factor: (ISRA), Impact Factor: 2.114

Arithmetic Mean Derivative Based Midpoint Rule

1B40 Practical Skills

A New Grey-rough Set Model Based on Interval-Valued Grey Sets

Convert the NFA into DFA

The Solution of Volterra Integral Equation of the Second Kind by Using the Elzaki Transform

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras

Research Article Moment Inequalities and Complete Moment Convergence

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Harmonic Mean Derivative - Based Closed Newton Cotes Quadrature

ORDER REDUCTION USING POLE CLUSTERING AND FACTOR DIVISION METHOD

Model Reduction of Finite State Machines by Contraction

Section 6.1 INTRO to LAPLACE TRANSFORMS

The Bochner Integral and the Weak Property (N)

FUZZY HOMOTOPY CONTINUATION METHOD FOR SOLVING FUZZY NONLINEAR EQUATIONS

7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus

2.4 Linear Inequalities and Interval Notation

Research Article Fejér and Hermite-Hadamard Type Inequalities for Harmonically Convex Functions

Hermite-Hadamard Type Inequalities for the Functions whose Second Derivatives in Absolute Value are Convex and Concave

Results on Planar Near Rings

Lecture 20: Numerical Integration III

Section 4: Integration ECO4112F 2011

Quadrature Rules for Evaluation of Hyper Singular Integrals

CHAPTER 1 PROGRAM OF MATRICES

A Convergence Theorem for the Improper Riemann Integral of Banach Space-valued Functions

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes

1. Extend QR downwards to meet the x-axis at U(6, 0). y

Section 14.3 Arc Length and Curvature

Expected Value of Function of Uncertain Variables

September 13 Homework Solutions

Note 12. Introduction to Digital Control Systems

Technical Note: Analytical sensitivity analysis of a two parameter recursive digital baseflow separation filter

Chapter 9 Definite Integrals

DIRECT CURRENT CIRCUITS

Preview 11/1/2017. Greedy Algorithms. Coin Change. Coin Change. Coin Change. Coin Change. Greedy algorithms. Greedy Algorithms

A General Dynamic Inequality of Opial Type

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

Adomian Decomposition Method with Green s. Function for Solving Twelfth-Order Boundary. Value Problems

Generalized Hermite-Hadamard-Fejer type inequalities for GA-convex functions via Fractional integral

[Lakshmi, 5(2): February, 2016] ISSN: (I2OR), Publication Impact Factor: 3.785

Linear Systems with Constant Coefficients

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms

Coalgebra, Lecture 15: Equations for Deterministic Automata

CHAPTER 2 FUZZY NUMBER AND FUZZY ARITHMETIC

Riemann Sums and Riemann Integrals

Research Article Composite Gauss-Legendre Formulas for Solving Fuzzy Integration

Definite integral. Mathematics FRDIS MENDELU

ROB EBY Blinn College Mathematics Department

Bases for Vector Spaces

Minimal DFA. minimal DFA for L starting from any other

Definite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30

Section 6: Area, Volume, and Average Value

When a force f(t) is applied to a mass in a system, we recall that Newton s law says that. f(t) = ma = m d dt v,

Chapter 6 Notes, Larson/Hostetler 3e

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Riemann Sums and Riemann Integrals

Deteriorating Inventory Model for Waiting. Time Partial Backlogging

Individual Contest. English Version. Time limit: 90 minutes. Instructions:

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

Studies on Nuclear Fuel Rod Thermal Performance

Solutions of Klein - Gordan equations, using Finite Fourier Sine Transform

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Homework 6. This homework is due October 11, 2016, at Noon.

A Generalized Inequality of Ostrowski Type for Twice Differentiable Bounded Mappings and Applications

p-adic Egyptian Fractions

Chapter 6 Techniques of Integration

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

MAC-solutions of the nonexistent solutions of mathematical physics

Boolean algebra.

Lecture 08: Feb. 08, 2019

METHODS OF APPROXIMATING THE RIEMANN INTEGRALS AND APPLICATIONS

On the Generalized Weighted Quasi-Arithmetic Integral Mean 1

Matching patterns of line segments by eigenvector decomposition

Generalized Fano and non-fano networks

LINEAR ALGEBRA APPLIED

Section 3.2 Maximum Principle and Uniqueness

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

APPLICATIONS OF DEFINITE INTEGRALS

1 Nondeterministic Finite Automata

19 Optimal behavior: Game theory

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +

Multiplication and Division of Triangular Fuzzy Numbers

Polynomials and Division Theory

13.3. The Area Bounded by a Curve. Introduction. Prerequisites. Learning Outcomes

Markscheme May 2016 Mathematics Standard level Paper 1

Reversible magnetization processes in scalar Preisachtype models of hysteresis

5: The Definite Integral

Calculus 2: Integration. Differentiation. Integration

Some circular summation formulas for theta functions

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary

Lecture 2: January 27

Transcription:

pplied Mthemticl Sciences, Vol. 8, 0, no. 5, 555-56 HIKRI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ms.0.9 Criticl Pth Prolem Using Intuitionistic Trpezoidl Fuzzy Numer P. Jygowri Deprtment of Mthemtics Sudhrsn Engineering College nn University Chenni, Indi G. Geethrmni Deprtment of Mthemtics, BIT Cmpus, nn University Chenni, Indi Copyright 0 P. Jygowri nd G. Geethrmni. This is n open ccess rticle distriuted under the Cretive Commons ttriution License, which permits unrestricted use, distriution, nd reproduction in ny medium, provided the originl work is properly cited. strct Criticl pth method is network sed method premeditted for scheduling nd orgniztion of complex project in rel world ppliction. In this pper, novel pproch hs een mde to find the criticl pth in directed cyclic grph, whose ctivity time is uncertin. The indistinguishle prmeters in the network re represented y intuitionistic trpezoidl fuzzy numers, insted of crisp numers. new procedure is proposed to find the optiml pth, nd n illustrtive exmple is provided to vlidte the proposed pproch. Keywords: Intuitionistic trpezoidl fuzzy numer, Grded men integrtion representtion of intuitionistic trpezoidl fuzzy numer, Rnking of intuitionistic fuzzy numer, Criticl pth.. Introduction constructed network is n impertive tool in the development nd orgnizes definite project execution. Network digrm plys vitl role in formtive project-completion time. In rel life sitution vgueness my rise from numer

556 P. Jygowri nd G. Geethrmni of possile sources like: due dte my e distorted, cpitl my unville wether sitution my root severl impediments. Therefore the fuzzy set theory cn ply significnt role in this kind of prolems to hndle the miguity out the time durtion of deeds in project network. G.Ling nd T.C.Hn [6] proposed fuzzy criticl pth for project networks. Elizeth nd L.Sujth[5] discussed criticl pth prolem under fuzzy Environment. C.T Chen nd S.F Hung[] proposed new model tht comines fuzzy set theory with the PERT technique to determine the criticl degrees of ctivities nd pths, ltest nd erliest strting time nd flots. S.H. Nsution[8] proposed fuzzy criticl pth method y considering interctive fuzzy sutrction nd y oserving tht only the non-negtive prt of the fuzzy numers cn hve physicl work. This pper is orgnized s follows: In section, sic definitions of intuitionistic fuzzy set theory hve een reviewed. Section, give procedures to find out the intuitionistic fuzzy criticl pth using n illustrtive exmple.in section the otined results re discussed. Finlly, in section 5 some conclusions re drwn.. Preliminries. Definition: Intuitionistic Fuzzy Set Let X e n Universe of discourse, then n Intuitionistic fuzzy set(ifs) in X is given y = x, μ ( x ), γ ( x) /x X, where the function μ (x) :X 0, nd γ (x) : X 0, determine the degree of memership nd non-memership of the element x X, respectively nd for every x X, 0 μ (x) γ (x).. Definition: Trpezoidl Intuitionistic Fuzzy Numer n Intuitionistic fuzzy numer,,,,,, is sid to e trpezoidl intuitionistic fuzzy numer if its memership function nd nonmemership function re given y (x) (x ) ( ) (x ) ( ) x x x (x) (x ( (x ( ) ) ) ) x x x

Criticl pth prolem 557. Definition: Grded Men Integrtion Representtion for Trpezoidl Intuitionistic Fuzzy Numer The memership nd non-memership function of trpezoidl intuitionistic fuzzy numers re defined s follows. L μ (x) L (x) Then x x w ; L nd R w ; L μ (h) ( L γ (h) ( x x & R (x) & R (x) x - x w ; x w ; x re inverse functions of functions L nd R respectively, ) h/w ) h/w & R μ (h) ( & R γ (h) ( ) h/w ) h/w Then the grded men integrtion representtion of memership function nd nonmemership function re, Pμ () 6 () & P () 6 ().5 Definition: Rnking of Intuitionistic Trpezoidl Fuzzy Numer[0] Let α nd β e ny α-cut nd β-cut set of n trpezoidl intuitionstic fuzzy numer ~ (,,c, d,,c, d ) respectively. Then the vlue of the memership nd non-memership function re defined s follows. c d c d c V ( ) nd V ( ) () 6 6 ~ ~ (,, c d,, c d nd B (,, c d, c d,,,,, e two trpezoidl intuitionstic fuzzy numers. If >d then >B..If Vµ()>Vµ(B) then >B. If Vµ()<Vµ(B) then < B. If Vµ()=Vµ(B) then equivlent B. Intuitionistic Fuzzy Criticl Pth Method The following is the procedure for finding intuitionistic fuzzy criticl pth.. Nottions N= the set of ll nodes in project network.

558 P. Jygowri nd G. Geethrmni EST = Erliest Strting Time EFTµij, EFTγij = Erliest Finishing Time for memership nd non-memership function. LFTµij, LFTγij = Ltest Finishing Time for memership nd non-memership function LSTµij, LSTγij = Ltest Strting Time for memership nd non-memership function TF = Totl Flot & Tij = The intuitionistic fuzzy ctivity time.. Forwrd Pss Clcultion: Forwrd pss clcultions re employed to clculte the Erliest Strting Time (EST) in the project network E E j j Mx Min i E i( ) t i j, i numer of preceding nodes E ( ) t i j, i numer of preceding nodes () i i Erliest Finishing Time for memership function EFT EST ( ) Intuitionisticfuzzyctivity time μ i j μ i j Erliest Finishing Time for non memership function EFT EST ( ) Intuitionisticfuzzyctivity time (5) γi j γi j. Bckwrd Pss Clcultion: Bckwrd pss clcultions re employed to clculte the Ltest Finishing Time (LFT) in the project network L L i j LST μ i LST γi Min Mx j i L j( ) t i j, j numer of succeeding nodes L ( ) t i j, j numer of succeeding nodes (6) i LtestStrting Time for memership function LFT ( ) Intuitionisticfuzzyctivity time j μ i j Ltest Finishing time for non memership function LFT ( ) Intuitionisticfuzzyctivity time j γi j (7). Totl Flot(TF) TF LFT TF LFT i j i j EFT EFT i j i j or TF LST or TF LST i j i j EST EST i j i j (8)

Criticl pth prolem 559. Procedure to Find Intuitionistic Fuzzy Criticl Pth Step: Construct network G(V,E) where V is the set of vertices nd E is the set of edges. Here G is n cyclic digrph nd rc length or edge weight re tken s intuitionistic trpezoidl fuzzy numers. Step : Expected time in terms of intuitionistic trpezoidl fuzzy numers re defuzzified using eqution nd in the network digrm. Step: Clculte erliest strting time for memership nd non-memership functions ( ESTµij nd ESTγij respectively) ccording to forwrd pss clcultion given in eqution () Step : Clculte erliest finishing time for memership nd non-memership functions (EFTµij nd EFTγij respectively ) using eqution (5). Step 5: Clculte ltest finishing time- LFTµij nd LFTγij - ccording to ckwrd pss clcultion given in eqution(6) Step 6: Clculte ltest strting time -LSTµij nd LSTγij- using eqution (7) Step 7: Clculte totl flot- TFµ nd TFγ -using eqution (8) Step 8: In ech ctivity using (8) whenever one get 0, such ctivities re clled s intuitionistic fuzzy criticl ctivities nd the corresponding pths intuitionistic criticl pths..5 Illustrtive exmple: Consider smll network with 5 vertices nd 6 edges shown in figure, where ech rc length is represented s trpezoidl Intuitionistic fuzzy numer Fig

560 P. Jygowri nd G. Geethrmni Tle: Results of the network ctivi ty Intuitionistic Fuzzy ctivity time <5,0,5,0> <,,6,8> <,6,8,0> <,6,9,> <8,,6,0> <,5,6,7> <0,5,8,> <0,,,6> <5,,5,> <,,,6> 5 <,6,0,> <8,0,,> Defuzzified ctivity TFµ TFγ time using eqution nd for memership nd non-memership functions <.5,5> 0.8 <7,7.> 8. 5.6 <,5.> 0 0 <6.,> 0.8 <.,.5> 8. 5.6 <8,0.5> 0 0 Tle: Rnk vlue of totl slck intuitionstic fuzzy time of ll possile pths Pths IFCPM(pµk) k= to m Rnk vlue Using eqution Rnk IFCPM(pγk) k= to m Rnk vlue Using eqution 5 <7,,5,65> 6.7 III <0,6,,5> 8.5 II 5 <0,8,6,> I <0,5,8,8> 5.7 I 5 <,,,55> 8. II <,9,5,8>. III Rnk. Results nd Discussion This pper proposes n lgorithm to tckle the prolem in intuitionistic fuzzy environment. In this pper the trpezoidl intuitionistic fuzzy numer is defuzzified using grded men integrtion representtion. Now the intuitionistic fuzzy numer is converted to crisp numer. Then pplying the proposed lgorithm we find the criticl pth. The pth in intuitionistic fuzzy project network re 5, 5nd 5.The criticl pth for intuitionistic fuzzy network for oth memership nd non-memership function re 5. Hence the procedure developed in this pper form new methods to get criticl pth, in intuitionistic fuzzy environment.

Criticl pth prolem 56 5. Conclusion new nlyticl method for finding criticl pth in n intuitionistic fuzzy project network hs een proposed. We hve used new defuzzifiction formul for trpezoidl fuzzy numer nd pplied to the flot time for ech ctivity in the intuitionistic fuzzy project network to find the criticl pth. In generl intuitionistic fuzzy models re more effective in determining criticl pths in rel project networks. This pper, use the grded men integrtion representtion the procedure to find the optiml pth in n intuitionistic fuzzy weighted grph hving help decision mkers to decide on the est possile criticl pth in intuitionistic fuzzy environments. References [] K.tnssov, Intuitionistic Fuzzy sets, nd systems, volume 0, No.(986),87-96. [] C.T Chen nd S.F. Hung, pplying fuzzy methods for mesuring criticlity in project network, Informtion sciences, 77(007)8-58. [] S.Chns P. nd Zielinski, Criticl Pth nlysis in the Network with Fuzzy ctivity Times, Fuzzy sets nd Systems, (00), 95-0. [] D. Duois nd H. Prde, Possiility Theory: n pproch to Computerized Processing of Uncertinty, New York: Plenum, 988. [5] S. Elizeth nd L.Sujth, Fuzzy Criticl Pth Prolem For Project Network, Interntionl Journl of Pure nd pplied Mthemtics Volume 85 No. 0, -0. [6] G.S. Ling nd T.C.Hn, Fuzzy Criticl Pth for Project Network, Informtion nd Mngement Sciences, 5, No. (00), 9-0. [7] Mhdvi. I.. Nourifr, R., Heidrzde.. nd miri. N. M. (009). Dynmic Progrmming pproch for Finding Shortest Chins in Fuzzy Network, pplied Soft Computing, Vol.9. No..pp.50-5. [8] S.H. Nsution, Fuzzy criticl pth method, IEEE Trns. Systems Mn Cyer net, (99) 8-57.

56 P. Jygowri nd G. Geethrmni [0]Slim rezvni, Rnking method of Trpezoidl Intuitionistic Fuzzy, nnls of Fuzzy Mthemtics nd Informtics, Vol-5.No:,(My0) p.p.55-5. [].I Slyeptsov, T.. Tyshchuk, Fuzzy Criticl Pth Method for Project Network Plnning nd Control, Cyer net. System nl. (997) 58 70. Received: Mrch 7, 0