Preliminary communication

https://doi.org/10.17818/NM/2018/3.2

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

Petr Chládek ; Faculty of Economics University of South Bohemia České Budějovice, Czech Republic
Dana Smetanová ; Faculty of Economics University of South Bohemia České Budějovice, Czech Republic

Abstract

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.

Keywords

czechoslovak ocean shipping; travelling salesman problem; graph theory; Hamiltonian cycles

Hrčak ID:

205855

URI

https://hrcak.srce.hr/205855

Publication date:

20.9.2018.

Visits: 843 *