Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using \(\alpha \)-cuts

DOI10.1016/J.CAMWA.2010.03.038zbMath1201.90196OpenAlexW2027448650MaRDI QIDQ611404

Ali Tajdin, Nezam Mahdavi-Amiri, Iraj Mahdavi, Bahram Sadeghpour-Gildeh

Publication date: 14 December 2010

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

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

zbMATH Keywords

dynamic programmingshortest pathfuzzy numbersregressiondistance functionlinear least squares\(\alpha \)-cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (2)

Optimal path selection approach for fuzzy reliable shortest path problem ⋮ Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment

Uses Software

• Algorithm 97

Cites Work

• Fuzzy shortest paths
• Shortest path problem on a network with imprecise edge weight
• Ranking fuzzy numbers in the setting of possibility theory
• Fuzzy sets and systems. Theory and applications
• The fuzzy shortest path problem and its most vital arcs
• Fuzzy shortest path problems incorporating interactivity among paths.
• Fuzzy location problems on networks.
• On comparing interval numbers
• Unified approach to fuzzy graph problems
• The fuzzy shortest path length and the corresponding shortest path in a network
• A shortest path problem on a network with fuzzy arc lengths

This page was built for publication: Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using \(\alpha \)-cuts