@article{44482,
   author = {Antoš, Karel},
   article_location = {Dubrovnik},
   article_number = {2},
   doi = {http://dx.doi.org/10.17818/NM/2018/2.4},
   keywords = {graph theory; minimum spanning tree; Joseph Kruskal; reverse algorithm},
   language = {eng},
   issn = {0469-6255},
   journal = {Nase More},
   title = {The Use of Weighted Adjacency Matrix for searching Optimal Ship Transportation Routes},
   volume = {65},
   year = {2018}
}

TY  - JOUR
ID  - 44482
AU  - Antoš, Karel
PY  - 2018
TI  - The Use of Weighted Adjacency Matrix for searching Optimal Ship Transportation Routes
JF  - Nase More
VL  - 65
IS  - 2
SP  - 87-93
EP  - 87-93
PB  - University of Dubrovnik
SN  - 04696255
KW  - graph theory
KW  - minimum spanning tree
KW  - Joseph Kruskal
KW  - reverse algorithm
N2  - 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.
ER  - 

ANTOŠ, Karel. The Use of Weighted Adjacency Matrix for searching Optimal Ship Transportation Routes. \textit{Nase More}. Dubrovnik: University of Dubrovnik, 2018, roč.~65, č.~2, s.~87-93. ISSN~0469-6255. doi:10.17818/NM/2018/2.4.