On some aspects of graph theory for optimal transport among marine ports

Kód výsledku v 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>
Nalezeny alternativní kódy
RIV/75081431:_____/18:00001550
Výsledek na webu
<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>

Jazyk výsledku
angličtina
Název v původním jazyce
On some aspects of graph theory for optimal transport among marine ports
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
On some aspects of graph theory for optimal transport among marine ports
Popis výsledku anglicky
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.

Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění
2018
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika
Scientific Journal of Silesian University of Technology. Series Transport
ISSN
0209-3324
e-ISSN
—
Svazek periodika
2018
Číslo periodika v rámci svazku
101
Stát vydavatele periodika
PL - Polská republika
Počet stran výsledku
9
Strana od-do
37-45
Kód UT WoS článku
000475496700004
EID výsledku v databázi Scopus
—

Podobné výsledky(10)