Using trapezoidal intuitionistic fuzzy number to find optimized path in a network
Summary: In real life, information available on situations/issues/problems is vague, inexact, or insufficient and so the parameters involved therein are grasped in an uncertain way by the decision maker. But in real life such uncertainty is unavoidable. One possible way out is to consider the knowledge of experts about the parameters involved as fuzzy data. In a network, the arc length may represent time or cost. In Relevant literature reports there are several methods to solve such problems in network-flow. This paper proposes an optimized path for use in networks, using trapezoidal intuitionistic fuzzy numbers, assigned to each arc length in a fuzzy environment. It proposes a new algorithm to find the optimized path and implied distance from source node to destination node.
- On searching intuitionistic fuzzy shortest path in a network
- Shortest path problem in a fuzzy network
- Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
- A shortest path problem on a network with fuzzy arc lengths
- Intuitionistic fuzzy shortest hyperpath in a network
- A shortest path problem on a network with fuzzy arc lengths
- Distances between intuitionistic fuzzy sets
- Fuzzy sets
- Fuzzy sets and systems. Theory and applications
- Fuzzy shortest paths
- Intuitionistic fuzzy sets
- On searching intuitionistic fuzzy shortest path in a network
- The fuzzy shortest path problem and its most vital arcs
- The shortest path problem on networks with fuzzy parameters
- The shortest path problem with discrete fuzzy arc lengths
This page was built for publication: Using trapezoidal intuitionistic fuzzy number to find optimized path in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888683)