Publication result detail

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

ŠEDA, M.

Original Title

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

English Title

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

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

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.

English abstract

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.

Keywords

minimum spanning tree, Steiner tree, heuristics, fuzzy number

Key words in English

minimum spanning tree, Steiner tree, heuristics, fuzzy number

Authors

ŠEDA, M.

Released

01.08.2006

ISBN

1305-5313

Periodical

Transactions on Engineering, Computing and Technology

Volume

14

Number

8

State

Republic of Turkey

Pages from

22

Pages count

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"
}