The Use of Weighted Adjacency Matrix for searching Optimal Ship Transportation Routes

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F18%3A00001266" target="_blank" >RIV/75081431:_____/18:00001266 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.17818/NM/2018/2.4" target="_blank" >http://dx.doi.org/10.17818/NM/2018/2.4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.17818/NM/2018/2.4" target="_blank" >10.17818/NM/2018/2.4</a>

Result language
angličtina
Original language name
The Use of Weighted Adjacency Matrix for searching Optimal Ship Transportation Routes
Original language description
This article provides a new approach to searching solutions of water transport optimalization problems. It brings a new tool of the graph theory which is the Weighted Adjacency Matrix. This Weighted Adjacency Matrix is suitable for searching for the Minimum Spanning Tree (MST) of the graph. It describes the Weighted Adjacency Matrix as a new element, and shows how it could be used in cases where weighted edges of the graph are given. This creates a new procedure of searching the MST of the graph and completes previously known algorithms of searching for the MST. In the field of ship transportation it could be succesfully used for solutions of optimizing transportation routes where smallest costs are wanted. Proposed Weighted Adjacency Matrix could be used in similar issues in the field of graph theory, where graphs with weighted edges are given. The procedure is shown on the attached example. The paper discusses the application of such route optimization technique forthe maritime sector.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

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

Similar results(10)