Publication detail

An Algorithm for the Network Steiner Tree Problem with Fuzzy Edge Lengths

ŠEDA, M.

English title

An Algorithm for the Network Steiner Tree Problem with Fuzzy Edge Lengths

Type

journal article - other

Language

en

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 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 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 in English

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

RIV year

2002

Released

01.06.2002

ISSN

0922-6389

Journal

Frontiers in Artificial Intelligence and Applications

Volume

76

Number

6

Pages count

7

BIBTEX


@article{BUT40759,
  author="Miloš {Šeda},
  title="An Algorithm for the Network Steiner Tree Problem with Fuzzy Edge Lengths",
  journal="Frontiers in Artificial Intelligence and Applications",
  year="2002",
  volume="76",
  number="6",
  month="June",
  issn="0922-6389"
}