The Use of Minimal Spanning Tree for Optimizing Ship Transportation

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 wher...

Full description

Saved in:
Bibliographic Details
Published in:NAŠE MORE 2016-07, Vol.63 (3), p.81-85
Main Author: Antoš, Karel
Format: Article
Language:English
Subjects:
graph theory
Joseph Kruskal
minimum spanning tree
Reverse-Delete Algorithm
ship transportation
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. A theoretical discussion and a model example are carried out to compare the two methods.
ISSN:0469-6255
1848-6320
DOI:10.17818/NM/2016/SI1