Travelling Salesman Problem Applied to Black Sea Ports used by Czech Ocean Shipping Companies

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60076658%3A12510%2F18%3A43897276" target="_blank" >RIV/60076658:12510/18:43897276 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.17818/NM/2018/3.2" target="_blank" >http://dx.doi.org/10.17818/NM/2018/3.2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.17818/NM/2018/3.2" target="_blank" >10.17818/NM/2018/3.2</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Travelling Salesman Problem Applied to Black Sea Ports used by Czech Ocean Shipping Companies

Popis výsledku v původním jazyce

Graph theory offers useful tools for solving problems in transportation. This article concerns the Travelling Salesman Problem. This classic transport problem is addressed in terms of Czech shipping companies and the ports on the Black Sea. Using mathematical software, a Hamiltonian cycle with the smallest sum of the weights of the edges along these ports is found and discussed. Algorithms based on graph theory are used to find the economically most advantageous path. The start and end of the route are located in Prague because Czech companies currently operating in maritime transport have headquarters located there.

Název v anglickém jazyce

Travelling Salesman Problem Applied to Black Sea Ports used by Czech Ocean Shipping Companies

Popis výsledku anglicky

Graph theory offers useful tools for solving problems in transportation. This article concerns the Travelling Salesman Problem. This classic transport problem is addressed in terms of Czech shipping companies and the ports on the Black Sea. Using mathematical software, a Hamiltonian cycle with the smallest sum of the weights of the edges along these ports is found and discussed. Algorithms based on graph theory are used to find the economically most advantageous path. The start and end of the route are located in Prague because Czech companies currently operating in maritime transport have headquarters located there.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

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

Nase More

ISSN

0469-6255

e-ISSN

—

Svazek periodika

65

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

HR - Chorvatská republika

Počet stran výsledku

5

Strana od-do

141-145

Kód UT WoS článku

000445586700003

EID výsledku v databázi Scopus

2-s2.0-85054039574