Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
From MaRDI portal
(Redirected from Publication:359406)
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)
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
Cites work
- scientific article; zbMATH DE number 859804 (Why is no real title available?)
- A consensus-reaching process under intuitionistic fuzzy preference relations
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
- A fuzzy shortest path with the highest reliability
- A generalization of Dijkstra's algorithm
- A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
- A new algorithm for the discrete fuzzy shortest path problem in a network
- A note on two problems in connexion with graphs
- A shortest path problem on a network with fuzzy arc lengths
- A theorem on the expected complexity of dijkstra's shortest path algorithm
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
- An efficient algorithm for computing least cost paths with turn constraints
- An improved Dijkstra's shortest path algorithm for sparse network
- An overview of methods for determining OWA weights
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using \(\alpha \)-cuts
- Distances between intuitionistic fuzzy sets
- Finding the shortest paths by node combination
- Fuzzy sets
- Fuzzy shortest path problem with finite fuzzy quantities
- Fuzzy shortest path problems incorporating interactivity among paths.
- Fuzzy shortest paths
- Handling multicriteria fuzzy decision-making problems based on vague set theory
- Interval valued intuitionistic fuzzy sets
- Intuitionistic fuzzy interpretations of multi-criteria multi-person and multi-measurement tool decision making
- Intuitionistic fuzzy sets
- Intuitionistic fuzzy sets. Theory and applications
- Intuitionistic preference relations and their application in group decision making
- MODELS FOR MULTIPLE ATTRIBUTE DECISION MAKING WITH INTUITIONISTIC FUZZY INFORMATION
- More on intuitionistic fuzzy sets
- Multiattribute decision making models and methods using intuitionistic fuzzy sets
- Multicriteria fuzzy decision-making problems based on vague set theory
- New models for shortest path problem with fuzzy arc lengths
- On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
- RANKING-INTUITIONISTIC FUZZY NUMBERS
- Remarks on some applications of intuitionistic fuzzy sets in decision making
- Solving shortest path problems with a weight constraint and replenishment arcs
- Some geometric aggregation operators based on intuitionistic fuzzy sets
- The fuzzy shortest path length and the corresponding 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
- Two theorems for intuitionistic fuzzy sets
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
- Using intuitionistic fuzzy sets in group decision making
- Vague sets
- Vague sets are intuitionistic fuzzy sets
Cited in
(11)- Multi-attribute group decision-making based on Bonferroni mean operators for picture hesitant fuzzy numbers
- An intelligent and robust framework towards anomaly detection, medical diagnosis, and shortest path problems based on interval-valued T-spherical fuzzy information
- On searching intuitionistic fuzzy shortest path in a network
- 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)
