Solving the Shortest Path Problem on a Graph with Fuzzy Edge Lengths
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU21357" target="_blank" >RIV/00216305:26210/01:PU21357 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving the Shortest Path Problem on a Graph with Fuzzy Edge Lengths
Original language description
In this paper, we deal with the shortest path problem (SPP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. Since fuzzy min operation based on the extension principle leads to nondominated solutions, we propose another approach to solving the SPP using Cheng's centroid point fuzzy ranking method. The described algorithm is a fuzzy generalization of Dijkstra's algorithm for the deterministic case.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 9th Fuzzy Colloquium
ISBN
3-9808089-0-4
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
247-253
Publisher name
Institut für Processtechnik, Processautomatisierung und Messtechnik Zittau/Görlitz
Place of publication
Zittau
Event location
Zittau
Event date
Sep 17, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—