Optimal path problem with possibilistic weights

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F14%3A33153218" target="_blank" >RIV/61989592:15310/14:33153218 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimal path problem with possibilistic weights

Popis výsledku v původním jazyce

The selection of optimal path is one of the classic problems in graph theory. Its utilization have various practical uses ranging from the transportation, civil engineering and other applications. Rarely those applications take into account the uncertainty of the weights of the graph. However this uncertainty can have high impact on the results. Several studies offer solution by implementing the fuzzy arithmetic for calculation of the optimal path but even in those cases neither of those studies proposed complete solution to the problem of ranking of the fuzzy numbers. In the study the ranking system based on the Theory of Possibility is used. The biggest advantage of this approach is that it very well addresses the indistinguishability of fuzzy numbers. Lengths of the paths are compared based on the possibility and the necessity of being smaller than the alternative. The algorithm offers the user more information than only the optimal path, instead the list of possible solutions is ca

Název v anglickém jazyce

Optimal path problem with possibilistic weights

Popis výsledku anglicky

The selection of optimal path is one of the classic problems in graph theory. Its utilization have various practical uses ranging from the transportation, civil engineering and other applications. Rarely those applications take into account the uncertainty of the weights of the graph. However this uncertainty can have high impact on the results. Several studies offer solution by implementing the fuzzy arithmetic for calculation of the optimal path but even in those cases neither of those studies proposed complete solution to the problem of ranking of the fuzzy numbers. In the study the ranking system based on the Theory of Possibility is used. The biggest advantage of this approach is that it very well addresses the indistinguishability of fuzzy numbers. Lengths of the paths are compared based on the possibility and the necessity of being smaller than the alternative. The algorithm offers the user more information than only the optimal path, instead the list of possible solutions is ca

Druh

C - Kapitola v odborné knize

CEP obor

DE - Zemský magnetismus, geodesie, geografie

OECD FORD obor

—

Projekt

<a href="/cs/project/EE2.3.20.0170" target="_blank" >EE2.3.20.0170: Budování výzkumně-vzdělávacího týmu v oblasti modelování přírodních jevů a využití geoinformačních systémů, s vazbou na zapojení do mezinárodních sítí a programů.</a><br>

Návaznosti

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

Rok uplatnění

2014

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 knihy nebo sborníku

Geoinformatics for Intelligent Transportation

ISBN

978-3-319-11463-7

Počet stran výsledku

12

Strana od-do

39-50

Počet stran knihy

272

Název nakladatele

Springer

Místo vydání

Heidelberg

Kód UT WoS kapitoly

—