This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n7http://purl.org/net/nknouf/ns/bibtex#
n3http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/ontology/domain/vavai/
n9https://schema.org/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F14%3A33153218%21RIV15-MSM-15310___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F14%3A33153218%21RIV15-MSM-15310___
rdf:type
n14:Vysledek skos:Concept
dcterms: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 calculated and the alternatives can be ranked using the possibility and the necessity to identify the possibly best variant. 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 calculated and the alternatives can be ranked using the possibility and the necessity to identify the possibly best variant.
dcterms:title
Optimal path problem with possibilistic weights Optimal path problem with possibilistic weights
skos:prefLabel
Optimal path problem with possibilistic weights Optimal path problem with possibilistic weights
skos:notation
RIV/61989592:15310/14:33153218!RIV15-MSM-15310___
n4:aktivita
n5:P
n4:aktivity
P(EE2.3.20.0170)
n4:dodaniDat
n13:2015
n4:domaciTvurceVysledku
n11:1218778 n11:8939381
n4:druhVysledku
n20:C
n4:duvernostUdaju
n15:S
n4:entitaPredkladatele
n17:predkladatel
n4:idSjednocenehoVysledku
34810
n4:idVysledku
RIV/61989592:15310/14:33153218
n4:jazykVysledku
n19:eng
n4:klicovaSlova
Uncertainty; Optimal path; Fuzzy numbers; Dijkstra algorithm
n4:klicoveSlovo
n6:Uncertainty n6:Fuzzy%20numbers n6:Optimal%20path n6:Dijkstra%20algorithm
n4:kontrolniKodProRIV
[4DD2EDBDF46C]
n4:mistoVydani
Heidelberg
n4:nazevZdroje
Geoinformatics for Intelligent Transportation
n4:obor
n12:DE
n4:pocetDomacichTvurcuVysledku
2
n4:pocetStranKnihy
272
n4:pocetTvurcuVysledku
2
n4:projekt
n18:EE2.3.20.0170
n4:rokUplatneniVysledku
n13:2014
n4:tvurceVysledku
Caha, Jan Dvorský, Jiří
s:numberOfPages
12
n7:hasPublisher
Springer-Verlag
n9:isbn
978-3-319-11463-7
n3:organizacniJednotka
15310