Detail publikace

Fuzzy All-Pairs Shortest Paths Problem

ŠEDA, M.

Originální název

Fuzzy All-Pairs Shortest Paths Problem

Typ

kapitola v knize

Jazyk

angličtina

Originální abstrakt

In this paper, we deal with the All-Pairs Shortest Paths Problem (APSPP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. Since the fuzzy min operator based on the extension principle leads to nondominated solutions, we propose another approach to solving the APSPP using a suitable fuzzy ranking method. We also show that the efficiency of computations may be improved by the proposed APSPP modification of the Dijkstra algorithm based on a binary heap data structure.

Klíčová slova

shortest path problem, fuzzy number, binary heap

Autoři

ŠEDA, M.

Vydáno

1. 9. 2006

Nakladatel

Springer-Verlag

Místo

Berlin, Germany

ISBN

978-3540347804

Kniha

Reusch, B. (ed.): Computational Intelligence, Theory and Applications

Edice

Advances in Soft Computing

Číslo edice

1

Strany od

395

Strany do

404

Strany počet

10

BibTex

@inbook{BUT55645,
  author="Miloš {Šeda}",
  title="Fuzzy All-Pairs Shortest Paths Problem",
  booktitle="Reusch, B. (ed.): Computational Intelligence, Theory and Applications",
  year="2006",
  publisher="Springer-Verlag",
  address="Berlin, Germany",
  series="Advances in Soft Computing",
  edition="1",
  pages="395--404",
  isbn="978-3540347804"
}