A New Ranking Approach for Solving Fully Fuzzy Transportation Problem in Intuitionistic Fuzzy Environment

Nishad, Anil Kumar; Abhishekh,

doi:10.1007/s40313-020-00611-x

Cited by 11 publications

(14 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It's commonly understood that the most cost-effective way to achieve a goal is by choosing the cheapest option. In the above example 1, it is observed that the intuitionistic fuzzy cost provided by the proposed method and Anil and Abhishek [24] are < 63, 308, 745; 2, 308, 1788 > and < 67, 308, 845; 2, 308, 2000 > respectively. Intuitionistic fuzzy transportation cost provided by proposed method is smaller than Anil and Abhishek [24] as the rank of Anil and Abhishek [24] is higher than the proposed method which shows that the proposed method expenses less than Anil and Abhishek [24] during transportation as shown in the Table 11.…”

Section: Cost-effectivenessmentioning

confidence: 91%

“…In recent years, Singh and Yadav [22,23] have solved two transportation problems, one with intuitionistic fuzzy requirements and availability but crisp costs (of type-1) and the other with crisp requirements, availability, and intuitionistic fuzzy costs (of type-2). However, the completely intuitionistic fuzzy transportation problem has been done by Anil and Abhishek [24]. In this work, the authors developed a transportation problem known as the fully intuitionistic fuzzy transportation problem (FIFTP), in which the cost of transportation and the availability of supplies and requirements are considered.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In this example, we consider the following TP undertaken by Anil and Abhishekh (2020) [24]. There are three sources, Sivakasi, Kollam and Nagercoil and three destinations, Tirunelveli, Trichy and Chennai, of a company.…”

Section: Examplementioning

confidence: 99%

See 2 more Smart Citations

New Ranking Approach of Intuitionistic Fuzzy Sets and its Application in Cognitive Transportation Problem

Saikia,

Dutta

2023

Preprint

View full text Add to dashboard Cite

In real-life problems, we frequently face uncertain situations because of human cognitive behaviour. Researchers have suggested meticulous mathematical notions to tackle such situations since its initiation. An intuitionistic fuzzy set is one of the effective extensions of a fuzzy set. Intuitionistic fuzzy sets have been applied in various real-life cognitive decision-making problems, for instance, engineering, medicine, pattern recognition, transportation, criminal investigation, etc. Numerous research works can be found in the literature, and most had several restrictions or were performed as unfit for providing human satisfaction outcomes. This work proposes a way to rank intuitionistic fuzzy sets using membership and non-membership functions. We discuss the benefits and provide examples to illustrate the approach. Then, we use our proposed ranking approach to deal with cognitive transportation problems, as it is well known that the core objective of transportation problems is to find optimal solutions. The literature contains various research studies on intuitionistic fuzzy problems with transportation. However, most of them have drawbacks.. Some methods are impractical, and others can't meet supply and demand limitations.. As a result, a method has been developed to lessen restrictions on solving methods of the intuitionistic fuzzy transportation problem. Although, some existing transportation problems are depicted in this work for a comparative study to elaborate on the significance of the present work. Our work deals with solving transportation problems in different uncertain situations using intuitionistic fuzzy environments like normal mixed type triangular, fully triangular and generalized trapezoidal intuitionistic fuzzy.. At the end of the study, hesitancy, cost effectiveness, statistical significant, sensitivity, result analysis, computational complexity and advantages are discussed to establish the effectiveness of the proposed work.

show abstract

Section: Cost-effectivenessmentioning

confidence: 91%

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

New Ranking Approach of Intuitionistic Fuzzy Sets and its Application in Cognitive Transportation Problem

Saikia,

Dutta

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Sam'an and Ifriza [26] developed a new solution approach combining the Total Difference Method (TDM) and Karagul-Sahin Approximation Method (KSAM) algorithm. In addition to these studies, studies [27]- [29] for the solution of fuzzy transportation problems are also included in the literature.…”

Section: Literature Reviewmentioning

confidence: 99%

Avoid maximum cost method for determining the initial basic feasible solution of the transportation problem

Özcan¹,

Karagül²,

Şahin³

2022

Pamukkale J Eng Sci

View full text Add to dashboard Cite

The transportation problem is an optimization problem related to determining the transportation plan that will ensure the transportation of products from supply points to demand points with minimum total cost. Although this problem can be modeled as a linear programming model because of its special structure, it is usually solved in two phases: finding the initial basic solution and finding the optimal solution. Thus, finding a good initial solution is important, especially in large problems since it will reduce the number of steps required in the second phase. To date, many approaches have been developed to find the initial basic solution. In this study, a new method called avoid maximum cost method is proposed for determining the initial basic solution of the transportation problem. The advantage of this algorithm is that it is easy to understand and implement. The avoid maximum cost method is applied to test problems and compared with six well-known initial solution methods. The results show that the proposed method produces a consistent and very good initial basic feasible solution. In addition, because of its simplicity, this method can be used as an alternative method for an initial basic feasible solution besides well-known methods in teaching.Ulaştırma Problemi, ürünlerin arz noktalarından talep noktalarına minimum toplam maliyetle taşınmasını sağlayacak taşıma planının belirlenmesi ile ilgili bir optimizasyon problemidir. Bu problem, özel yapısı nedeniyle bir doğrusal programlama modeli olarak modellenebilse de genellikle başlangıç temel çözümünü bulma ve en uygun çözümü bulma olmak üzere iki aşamada çözülür. Bu nedenle, özellikle büyük problemlerde, ikinci aşamada gereken adım sayısını azaltacağından, iyi bir başlangıç çözümü bulmak önemlidir. Bugüne kadar başlangıç temel çözümünü bulmak için birçok yaklaşım geliştirilmiştir. Bu çalışmada, ulaştırma probleminin başlangıç çözümünün belirlenmesi için maksimum maliyetten kaçınma yöntemi adı verilen yeni bir yöntem önerilmiştir. Bu algoritmanın avantajı, anlaşılması ve uygulanmasının kolay olmasıdır. Maksimum maliyetten kaçınma yöntemi test problemlerine uygulanmış ve iyi bilen altı başlangıç çözüm yöntemi ile karşılaştırılmıştır. Sonuçlar önerilen yöntemin tutarlı ve iyi başlangıç uygun çözümler ürettiğini göstermektedir. Ayrıca, çok basit olması nedeniyle bu yöntem öğretimde çok bilinen yöntemlerle birlikte başlangıç uygun çözümlerin bulunmasında alternatif olarak kullanılabilir.

show abstract

“…As a rule, publications in the area of linear programming present new methods [36,37], techniques [38], algorithms [39], or improvements [40] to existing methods. On the other hand, solutions that could be defined as innovative are less common [41].…”

mentioning

confidence: 99%

Method for Calculating the Required Number of Transport Vehicles Supplying Aviation Fuel to Aircraft during Combat Tasks

et al. 2022

View full text Add to dashboard Cite

During aircraft flights, combat readiness and the supply system affecting it are essential issues. The basic items of supply during the implementation of tasks are combat assets and aviation fuel. Effective management of the flow of required products, as well as the reliability of vehicles and the availability of crews contribute to the quality of task performance. The components that make up this quality in military operations are measured by readiness. In real-life operations, the number of vehicles supplying aircraft with aviation fuel is determined for safety and reliability with an surplus related to the number of flight support facilities. This paper develops a method for determining the minimum number of vehicles required to supply aircraft (sp) with aviation fuels. The developed method was verified by a numerical example illustrating its application in practice. Additionally, a detailed analysis of its application was carried out in relation to potentially 50 possible scenarios of combat task execution, with a number of assumptions fulfilled. Based on the performed calculations, it was concluded that the number of vehicles required for sp fuel supply depends on several factors: the number of aircraft, the characteristics of air tasks (flight length and frequency of departures), as well as the time of clean sp refuelling and the duration of the vehicle-tanker refuelling cycle.

show abstract

A New Ranking Approach for Solving Fully Fuzzy Transportation Problem in Intuitionistic Fuzzy Environment

Cited by 11 publications

References 31 publications

New Ranking Approach of Intuitionistic Fuzzy Sets and its Application in Cognitive Transportation Problem

New Ranking Approach of Intuitionistic Fuzzy Sets and its Application in Cognitive Transportation Problem

Avoid maximum cost method for determining the initial basic feasible solution of the transportation problem

Method for Calculating the Required Number of Transport Vehicles Supplying Aviation Fuel to Aircraft during Combat Tasks

Contact Info

Product

Resources

About