The shortest path problem is a very well-known optimization problem where the purpose is to find a path originating from the source node and terminating at vertex node in such a way that the sum of edge weights of constituent edges is minimum. This paper presents shortest path problem in an imprecise environment, edge weights being represented by Interval Type 2 Triangular fuzzy number. This paper introduces fuzzy preference ordering between any two Interval type 2 triangular fuzzy numbers and uses that to choose a path according to varying degrees of optimism and pessimism of decision maker. A numerical example has also been solved to present the effectiveness of the method presented and explains how the path changes as the degree of optimism and pessimism varies.
Solving Fuzzy Shortest Path Problem with Decision Maker’s Perspective
Lecture Notes in Civil Engineering
International Conference on Advances in Civil Engineering ; 2020 May 28, 2020 - May 29, 2020
15.12.2021
13 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Efficient Algorithms for Solving the Shortest Covering Path Problem
Online Contents | 1994
|British Library Online Contents | 2012
|An efficient dynamic model for solving the shortest path problem
Online Contents | 2013
|