Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
DOI10.1007/s10852-012-9191-7zbMath1292.05148MaRDI QIDQ359406
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
shortest path problem; Dijkstra's algorithm; decision making problem; intuitionistic fuzzy sets; intuitionistic fuzzy numbers; intutionistic fuzzy hybrid geometric operator; intutionistic fuzzy value
05C35: Extremal problems in graph theory
90B50: Management decision making, including multiple objectives
03E72: Theory of fuzzy sets, etc.
05C30: Enumeration in graph theory
05C38: Paths and cycles
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs
05C72: Fractional graph theory, fuzzy graph theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- An efficient algorithm for computing least cost paths with turn constraints
- Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using \(\alpha \)-cuts
- Finding the shortest paths by node combination
- 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
- A fuzzy shortest path with the highest reliability
- Intuitionistic fuzzy sets
- Interval valued intuitionistic fuzzy sets
- 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
- Vague sets are intuitionistic fuzzy sets
- Fuzzy shortest path problems incorporating interactivity among paths.
- Multicriteria fuzzy decision-making problems based on vague set theory
- Distances between intuitionistic fuzzy sets
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
- Solving shortest path problems with a weight constraint and replenishment arcs
- The fuzzy shortest path length and the corresponding shortest path in a network
- Multiattribute decision making models and methods using intuitionistic fuzzy sets
- Intuitionistic fuzzy sets. Theory and applications
- More on intuitionistic fuzzy sets
- Handling multicriteria fuzzy decision-making problems based on vague set theory
- A shortest path problem on a network with fuzzy arc lengths
- Two theorems for intuitionistic fuzzy sets
- A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
- The shortest path problem on networks with fuzzy parameters
- The shortest path problem with discrete fuzzy arc lengths
- A new algorithm for the discrete fuzzy shortest path problem in a network
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Some geometric aggregation operators based on intuitionistic fuzzy sets
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
- A theorem on the expected complexity of dijkstra's shortest path algorithm
- Vague sets
- A consensus-reaching process under intuitionistic fuzzy preference relations
- RANKING-INTUITIONISTIC FUZZY NUMBERS
- MODELS FOR MULTIPLE ATTRIBUTE DECISION MAKING WITH INTUITIONISTIC FUZZY INFORMATION
- An overview of methods for determining OWA weights
- Intuitionistic fuzzy interpretations of multi-criteria multi-person and multi-measurement tool decision making
- Fuzzy sets