hrcak mascot   Srce   HID

Prethodno priopćenje
https://doi.org/10.17818/NM/2016/SI1

The Use of Minimal Spanning Tree for Optimizing Ship Transportation

Karel Antoš ; Department of Informatics and Natural Sciences Institute of Technology and Business in České Budějovice, Czech Republic

Puni tekst: engleski, pdf (1 MB) str. 81-85 preuzimanja: 461* citiraj
APA 6th Edition
Antoš, K. (2016). The Use of Minimal Spanning Tree for Optimizing Ship Transportation. NAŠE MORE, 63 (3 Special Issue), 81-85. https://doi.org/10.17818/NM/2016/SI1
MLA 8th Edition
Antoš, Karel. "The Use of Minimal Spanning Tree for Optimizing Ship Transportation." NAŠE MORE, vol. 63, br. 3 Special Issue, 2016, str. 81-85. https://doi.org/10.17818/NM/2016/SI1. Citirano 21.01.2020.
Chicago 17th Edition
Antoš, Karel. "The Use of Minimal Spanning Tree for Optimizing Ship Transportation." NAŠE MORE 63, br. 3 Special Issue (2016): 81-85. https://doi.org/10.17818/NM/2016/SI1
Harvard
Antoš, K. (2016). 'The Use of Minimal Spanning Tree for Optimizing Ship Transportation', NAŠE MORE, 63(3 Special Issue), str. 81-85. https://doi.org/10.17818/NM/2016/SI1
Vancouver
Antoš K. The Use of Minimal Spanning Tree for Optimizing Ship Transportation. NAŠE MORE [Internet]. 2016 [pristupljeno 21.01.2020.];63(3 Special Issue):81-85. https://doi.org/10.17818/NM/2016/SI1
IEEE
K. Antoš, "The Use of Minimal Spanning Tree for Optimizing Ship Transportation", NAŠE MORE, vol.63, br. 3 Special Issue, str. 81-85, 2016. [Online]. https://doi.org/10.17818/NM/2016/SI1

Sažetak
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.

Ključne riječi
ship transportation; graph theory; minimum spanning tree; Joseph Kruskal; Reverse-Delete Algorithm

Hrčak ID: 162524

URI
https://hrcak.srce.hr/162524

Posjeta: 606 *