The Use of Minimal Spanning Tree for Optimizing Ship Transportation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F16%3A00000709" target="_blank" >RIV/75081431:_____/16:00000709 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
The Use of Minimal Spanning Tree for Optimizing Ship Transportation
Original language description
This article describes a design of solving ship transport optimization using tools from graph theory. The tool minimal spanning tree (denote MST) is suitable for searching ideal transport routes between the ports. The principle of the MST problem is that it describes various kinds of situations where it is necessary to use this theoretical instrument and how to use this tool for finding a solution. Graph theory knows several algorithms for searching the minimum spanning tree and this article compares two of them, in terms of their different approaches, their complementarity, and their assessment, and which of these two methods can find a feasible solution faster. To model the situation of ship transportation we use connected weighted graph where vertices represent sea ports and the edges represent the transport routes between the ports. The weight of an edge represents energy consumed to drive the boat between two ports.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
AM - Pedagogy and education
OECD FORD branch
—

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

Similar results(10)