Abstract
In this paper a new average method is proposed for finding an optimal solution for an intuitionistic fuzzy transportation problem. The main feature of this method is that it requires very simple arithmetical calculations and avoids large number of iterations. An accuracy function to defuzzify Triangular Intuitionistic Fuzzy Number is also used. Based on this new approach, the optimal solution of Intuitionistic Fuzzy transportation problem is obtained. Finally, an illustrative example is given to verify the developed approach. AMS Subject Classification: 03E72, 03F55, 90B06
Highlights
Transportation problem is a particular class of linear programming. It deals with the transportation of a single product manufactured at different plants to a number of different warehouses
Basic arithmetic operations of TIFNs is defined by Deng-Feng Li in [2] using membership and non-membership values
Basic arithmetic operations of TIFNs such as addition, subtraction and multiplication are defined by S.Mahapatra and T.K.Roy in [4], by considering the six tuple number itself
Summary
Transportation problem is a particular class of linear programming It deals with the transportation of a single product manufactured at different plants (supply origins) to a number of different warehouses (demand destinations). Basic arithmetic operations of TIFNs is defined by Deng-Feng Li in [2] using membership and non-membership values. Basic arithmetic operations of TIFNs such as addition, subtraction and multiplication are defined by S.Mahapatra and T.K.Roy in [4], by considering the six tuple number itself. Most of the authors used the membership and non − membership values of TIFNs for ranking. In this paper we have defined ranking of TIFNs using integral value by considering six tuple TIFNs introduced in [6]. We have considered TIFN and integral value for ranking This ranking is applied to solve Intuitionistic Fuzzy Transportation Problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have