Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
DOI10.1007/S10852-012-9191-7zbMATH Open1292.05148OpenAlexW1971087042MaRDI QIDQ359406FDOQ359406
Authors: Sathi Mukherjee 
Publication date: 12 August 2013
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-012-9191-7
Recommendations
- On searching intuitionistic fuzzy shortest path in a network
- Solving the fuzzy shortest path problem on networks by a new algorithm
- A new algorithm for the discrete fuzzy shortest path problem in a network
- The shortest path problem on networks with fuzzy parameters
- Intuitionistic fuzzy shortest hyperpath in a network
- Shortest path problem in a fuzzy network
- Fuzzy programming technique for solving the shortest path problem on networks under triangular and trapezoidal fuzzy environment
- scientific article; zbMATH DE number 6124415
- Constraint shortest path problem in a network with intuitionistic fuzzy arc weights
shortest path problemDijkstra's algorithmdecision making problemintuitionistic fuzzy setsintuitionistic fuzzy numbersintutionistic fuzzy hybrid geometric operatorintutionistic fuzzy value
Theory of fuzzy sets, etc. (03E72) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Management decision making, including multiple objectives (90B50) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Paths and cycles (05C38) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- A note on two problems in connexion with graphs
- Intuitionistic fuzzy sets
- Fuzzy sets
- Interval valued intuitionistic fuzzy sets
- Vague sets are intuitionistic fuzzy sets
- Some geometric aggregation operators based on intuitionistic fuzzy sets
- Vague sets
- Intuitionistic fuzzy sets. Theory and applications
- Handling multicriteria fuzzy decision-making problems based on vague set theory
- Two theorems for intuitionistic fuzzy sets
- Intuitionistic fuzzy interpretations of multi-criteria multi-person and multi-measurement tool decision making
- An efficient algorithm for computing least cost paths with turn constraints
- An overview of methods for determining OWA weights
- Multicriteria fuzzy decision-making problems based on vague set theory
- Multiattribute decision making models and methods using intuitionistic fuzzy sets
- MODELS FOR MULTIPLE ATTRIBUTE DECISION MAKING WITH INTUITIONISTIC FUZZY INFORMATION
- Finding the shortest paths by node combination
- Solving shortest path problems with a weight constraint and replenishment arcs
- More on intuitionistic fuzzy sets
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Fuzzy shortest path problems incorporating interactivity among paths.
- A shortest path problem on a network with fuzzy arc lengths
- The shortest path problem on networks with fuzzy parameters
- Distances between intuitionistic fuzzy sets
- A fuzzy shortest path with the highest reliability
- A generalization of Dijkstra's algorithm
- On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
- The fuzzy shortest path problem and its most vital arcs
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
- The fuzzy shortest path length and the corresponding shortest path in a network
- A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
- The shortest path problem with discrete fuzzy arc lengths
- A new algorithm for the discrete fuzzy shortest path problem in a network
- Remarks on some applications of intuitionistic fuzzy sets in decision making
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
- A theorem on the expected complexity of dijkstra's shortest path algorithm
- A consensus-reaching process under intuitionistic fuzzy preference relations
- RANKING-INTUITIONISTIC FUZZY NUMBERS
- Title not available (Why is that?)
- Using intuitionistic fuzzy sets in group decision making
- Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using \(\alpha \)-cuts
- Fuzzy shortest paths
- Fuzzy shortest path problem with finite fuzzy quantities
- An improved Dijkstra's shortest path algorithm for sparse network
- Intuitionistic preference relations and their application in group decision making
- New models for shortest path problem with fuzzy arc lengths
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
Cited In (11)
- Multi-attribute group decision-making based on Bonferroni mean operators for picture hesitant fuzzy numbers
- On searching intuitionistic fuzzy shortest path in a network
- An intelligent and robust framework towards anomaly detection, medical diagnosis, and shortest path problems based on interval-valued T-spherical fuzzy information
- PSO based constraint optimization of intuitionistic fuzzy shortest path problem in an undirected network
- Constraint shortest path problem in a network with intuitionistic fuzzy arc weights
- Intuitionistic fuzzy shortest hyperpath in a network
- A new algorithm for the discrete fuzzy shortest path problem in a network
- Certain notions of picture fuzzy information with applications
- Using trapezoidal intuitionistic fuzzy number to find optimized path in a network
- Analysis of social networks and Wi-Fi networks by using the concept of picture fuzzy graphs
- A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city
This page was built for publication: Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359406)
