The Usability of Algorithms from Graph Theory in the Field of Multicriteria Analysis

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62156489%3A43110%2F24%3A43925835" target="_blank" >RIV/62156489:43110/24:43925835 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.11118/978-80-7509-990-7-0060" target="_blank" >https://doi.org/10.11118/978-80-7509-990-7-0060</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.11118/978-80-7509-990-7-0060" target="_blank" >10.11118/978-80-7509-990-7-0060</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The Usability of Algorithms from Graph Theory in the Field of Multicriteria Analysis

Popis výsledku v původním jazyce

The main ideas, on how to use algorithms from the Graph Theory to improve the process of Multicriteria Analysis were presented in the paper (Farana, 2016). This paper presents practical results obtained by the use of these algorithms in practical decision-making procedures when multicriteria analysis has been used. Graph algorithms were used in two situations when determining the values of the weights of decision criteria. First was the checking, if the Fuller&apos;s triangle, filled in by an expert, is filled in correctly. For this verification, a complete graph is used in which the vertices represent the criteria the orientation of the edges their mutual significance. A method of gluing vertices could be used for criteria with the same significance. The resulting graph must be acyclic. Twenty-five decision tasks with seven or more criteria were analyzed and the obtained results will be presented in the paper. The second application was the elimination of the overdetermination of the assessment in Saaty&apos;s method. A spanning tree describing dependencies between criteria has been used according to the algorithm in (Farana, 2016). Obtained results were compared with the full Saaty&apos;s matrix when the number of compared pairs of criteria is k - 1 for k criteria, compared to the number of k(k - 1)/2 in the classic Saaty&apos;s method. Fifteen decision tasks with seven or more criteria were analyzed and the obtained results will be presented in the paper. The paper presents the differences between the assessment given directly by experts and the assessment obtained using the spanning tree and shows that the described method is applicable in practice. The experience of experts using the proposed procedure, obtained through a guided interview, was mostly positive.

Název v anglickém jazyce

The Usability of Algorithms from Graph Theory in the Field of Multicriteria Analysis

Popis výsledku anglicky

The main ideas, on how to use algorithms from the Graph Theory to improve the process of Multicriteria Analysis were presented in the paper (Farana, 2016). This paper presents practical results obtained by the use of these algorithms in practical decision-making procedures when multicriteria analysis has been used. Graph algorithms were used in two situations when determining the values of the weights of decision criteria. First was the checking, if the Fuller&apos;s triangle, filled in by an expert, is filled in correctly. For this verification, a complete graph is used in which the vertices represent the criteria the orientation of the edges their mutual significance. A method of gluing vertices could be used for criteria with the same significance. The resulting graph must be acyclic. Twenty-five decision tasks with seven or more criteria were analyzed and the obtained results will be presented in the paper. The second application was the elimination of the overdetermination of the assessment in Saaty&apos;s method. A spanning tree describing dependencies between criteria has been used according to the algorithm in (Farana, 2016). Obtained results were compared with the full Saaty&apos;s matrix when the number of compared pairs of criteria is k - 1 for k criteria, compared to the number of k(k - 1)/2 in the classic Saaty&apos;s method. Fifteen decision tasks with seven or more criteria were analyzed and the obtained results will be presented in the paper. The paper presents the differences between the assessment given directly by experts and the assessment obtained using the spanning tree and shows that the described method is applicable in practice. The experience of experts using the proposed procedure, obtained through a guided interview, was mostly positive.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

50202 - Applied Economics, Econometrics

Projekt

<a href="/cs/project/EF16_017%2F0002334" target="_blank" >EF16_017/0002334: Výzkumná infrastruktura pro mladé vědce</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

26th International Conference Economic Competitiveness and Sustainability: Proceedings

ISBN

978-80-7509-990-7

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

60-64

Název nakladatele

Mendelova univerzita v Brně

Místo vydání

Brno

Místo konání akce

Brno

Datum konání akce

21. 3. 2024

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—