About: Optimal path problem with possibilistic weights

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Optimal path problem with possibilistic weights Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
Title	Optimal path problem with possibilistic weights Optimal path problem with possibilistic weights (en)
skos:prefLabel	Optimal path problem with possibilistic weights Optimal path problem with possibilistic weights (en)
skos:notation	RIV/61989592:15310/14:33153218!RIV15-MSM-15310___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(EE2.3.20.0170)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Dvorský, Jiří Caha, Jan
http://linked.open.../riv/druhVysledku	C - Kapitola v knize
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Palackého v Olomouci / Přírodovědecká fakulta
http://linked.open...dnocenehoVysledku	34810
http://linked.open...ai/riv/idVysledku	RIV/61989592:15310/14:33153218
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Uncertainty; Optimal path; Fuzzy numbers; Dijkstra algorithm (en)
http://linked.open.../riv/klicoveSlovo	Uncertainty Dijkstra algorithm Fuzzy numbers Optimal path
http://linked.open...ontrolniKodProRIV	[4DD2EDBDF46C]
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Geoinformatics for Intelligent Transportation
http://linked.open...in/vavai/riv/obor	DE
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...v/pocetStranKnihy	272 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	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
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Dvorský, Jiří Caha, Jan
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-319-11463-7
http://localhost/t...ganizacniJednotka	15310

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 9 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software