The shortest path problem with discrete fuzzy arc lengths

DOI10.1016/j.camwa.2004.08.011zbMath1074.90009OpenAlexW1990957023MaRDI QIDQ2485400

Tzung-Nan Chuang, Jung-Yuan Kung

Publication date: 4 August 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.08.011

zbMATH Keywords

networkpath problem

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (3)

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 ⋮ Using trapezoidal intuitionistic fuzzy number to find optimized path in a network

Cites Work

• 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

This page was built for publication: The shortest path problem with discrete fuzzy arc lengths