On some aspects of graph theory for optimal transport among marine ports
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60076658%3A12510%2F18%3A43898082" target="_blank" >RIV/60076658:12510/18:43898082 - isvavai.cz</a>
Alternative codes found
RIV/75081431:_____/18:00001550
Result on the web
<a href="http://sjsutst.polsl.pl/archives/2018/vol101/037_SJSUTST101_2018_Chladek_Smetanova_Krile.pdf" target="_blank" >http://sjsutst.polsl.pl/archives/2018/vol101/037_SJSUTST101_2018_Chladek_Smetanova_Krile.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.20858/sjsutst.2018.101.4" target="_blank" >10.20858/sjsutst.2018.101.4</a>
Alternative languages
Result language
angličtina
Original language name
On some aspects of graph theory for optimal transport among marine ports
Original language description
This paper is devoted to the Travelling Salesman Problem as applied to Czechoslovak ocean shipping companies and their marine ports on the Black Sea. The shortest circular path around these ports is found and discussed. Formulation of the problem accounts for the fact that distances between the individual cities are not the same in both directions. The consequences that arise from this situation are studied. The used algorithms are based on graph theory and standard logistic methods. In addition, the results are compared with the results obtained by using a minimum spanning tree algorithm.
Czech name
—
Czech description
—
Classification
Type
J<sub>ost</sub> - Miscellaneous article in a specialist periodical
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Scientific Journal of Silesian University of Technology. Series Transport
ISSN
0209-3324
e-ISSN
—
Volume of the periodical
2018
Issue of the periodical within the volume
101
Country of publishing house
PL - POLAND
Number of pages
9
Pages from-to
37-45
UT code for WoS article
000475496700004
EID of the result in the Scopus database
—