Determining the shortest path on an intuitionistic fuzzy graph with interval value using floyd Warshall algorithm

• Published in: AIP conference proceedings Vol. 2639; no. 1
• Main Authors: Rakhmawati, Nahlia, Widodo, Agus, Hidayat, Noor, Alghifari, Abdul Rouf
• Format: Journal Article Conference Proceeding
• Language: English
• Published: Melville American Institute of Physics 02.11.2022
• Subjects: Algorithms; Apexes; Fuzzy systems; Graph theory; Optimization; Shortest-path problems
• ISSN: 0094-243X; 1935-0465; 1551-7616; 1551-7616
• DOI: 10.1063/5.0110008

The shortest path problem is a classical network optimization problem which has a wide range of applications in various fields. One of the interesting algorithms to solve shortest path problem is Floyd Warshall s algorithm. The advantage of the floyd warshall algorithm is that it’s capability to obtain the shortest distance between all edges on the graph. In this study, the Floyd Warhsall algorithm is applied to shortest path on an interval-valued intuitionistic fuzzy graph. Intuitionistic fuzzy graph is a graph with an intuitionistic fuzzy number value that is used to describe the relationship between each vertices. It was the firstly used of Floyd Warshall algorithm in an interval-valued intuitionistic fuzzy graph. Here we examined the effectiveness of the Floyd Warshall algorithm by comparing it with the results of previous studies.