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

Result code in 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>
Result on the web
<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>

Result language
angličtina
Original language name
Travelling Salesman Problem Applied to Black Sea Ports used by Czech Ocean Shipping Companies
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)