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.
Travelling Salesman Problem Applied to Black Sea Ports used by Czech Ocean Shipping Companies
2018
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
On the Discretized Dubins Travelling Salesman Problem
British Library Conference Proceedings | 2014
|Generalized travelling-salesman problem and its applications
Tema Archiv | 1976
|Hybrid ABC/PSO to solve travelling salesman problem
British Library Online Contents | 2013
|Hybrid ABC/PSO to solve travelling salesman problem
British Library Online Contents | 2013
|