A new algorithm for the discrete fuzzy shortest path problem in a network

DOI10.1016/j.amc.2005.04.097zbMath1092.90053OpenAlexW2017782972MaRDI QIDQ2490237

Tzung-Nan Chuang, Jung-Yuan Kung

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.097

zbMATH Keywords

Fuzzy similarityDiscrete fuzzy setsThe shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

STOCHASTIC SCENARIO-BASED TIME-STAGE OPTIMIZATION MODEL FOR THE LEAST EXPECTED TIME SHORTEST PATH PROBLEM ⋮ Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ Solving a tri-criteria best path problem using the fuzzy decision making ⋮ Clifford algebra method for network expression, computation, and algorithm construction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a multicriteria shortest path problem
• Fuzzy shortest paths
• Correlation between two fuzzy membership functions
• Paths of least resistance in possibilistic production systems
• Fuzzy sets and systems. Theory and applications
• Correlation of intuitionistic fuzzy sets
• New similarity measures on fuzzy sets and on elements
• Entropy, distance measure and similarity measure of fuzzy sets and their relations
• A comparative assessment of measures of similarity of fuzzy values
• The fuzzy shortest path problem and its most vital arcs
• An empirical investigation of some bicriterion shortest path algorithms
• A shortest path problem on a network with fuzzy arc lengths