Optimal path problem with possibilistic weights

Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Optimal path problem with possibilistic weights
Original language description
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
Czech name
—
Czech description
—

Project
<a href="/en/project/EE2.3.20.0170" target="_blank" >EE2.3.20.0170: Building of Research Team in the Field of Environmental Modeling and the Use of Geoinformation Systems with the Consequence in Participation in International Networks and Programs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)