Detail publikačního výsledku

Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs

ŠEDA, M.

Originální název

Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs

Anglický název

Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since a fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method.

Anglický abstrakt

In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since a fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method.

Klíčová slova

minimum spanning tree, Steiner tree, heuristics, fuzzy number

Klíčová slova v angličtině

minimum spanning tree, Steiner tree, heuristics, fuzzy number

Autoři

ŠEDA, M.

Vydáno

01.08.2006

ISSN

1305-5313

Periodikum

Transactions on Engineering, Computing and Technology

Svazek

14

Číslo

8

Stát

Turecká republika

Strany od

22

Strany počet

5

BibTex

@article{BUT43700,
  author="Miloš {Šeda}",
  title="Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs",
  journal="Transactions on Engineering, Computing and Technology",
  year="2006",
  volume="14",
  number="8",
  pages="5",
  issn="1305-5313"
}