Publication detail

Solving the Shortest Path Problem on a Graph with Fuzzy Edge Lengths

ŠEDA, M.

Original Title

Solving the Shortest Path Problem on a Graph with Fuzzy Edge Lengths

Type

conference paper

Language

English

Original Abstract

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.

Key words in English

single shortest path problem, fuzzy ranking, binary heap, priority queue

Authors

ŠEDA, M.

RIV year

2001

Released

1. 9. 2001

Publisher

Institut für Processtechnik, Processautomatisierung und Messtechnik Zittau/Görlitz

Location

Zittau

ISBN

3-9808089-0-4

Book

Proceedings of the 9th Fuzzy Colloquium

Pages from

247

Pages to

253

Pages count

7

BibTex

@inproceedings{BUT6617,
  author="Miloš {Šeda}",
  title="Solving the Shortest Path Problem on a Graph with Fuzzy Edge Lengths",
  booktitle="Proceedings of the 9th Fuzzy Colloquium",
  year="2001",
  pages="7",
  publisher="Institut für Processtechnik, Processautomatisierung und Messtechnik Zittau/Görlitz",
  address="Zittau",
  isbn="3-9808089-0-4"
}