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

Primjena problema trgovačkog putnika na crnomorske luke na primjeru čeških brodarskih tvrtki

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.

• Record URL:
  • https://doi.org/10.17818/NM/2018/3.2
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/04696255
• Supplemental Notes:
  • © 2018 University of Dubrovnik.
• Authors:
  • Chládek, Petr
  • Smetanová, Dana
• Publication Date: 2018-9

Language

• English
• Croatian

Media Info

• Media Type: Digital/other
• Features: Figures; References; Tables;
• Pagination: pp 141-145
• Serial:
  • Naše More: International Journal of Maritime Science & Technology
  • Volume: 65
  • Issue Number: 3
  • Publisher: University of Dubrovnik
  • ISSN: 0469-6255
  • EISSN: 1848-6320
  • Serial URL: http://hrcak.srce.hr/nase-more
• Publication flags:

  Open Access (libre)

Subject/Index Terms

• TRT Terms: Graph theory; Ocean shipping; Seaports; Traveling salesman problem; Water transportation
• Geographic Terms: Black Sea; Prague (Czech Republic)
• Subject Areas: Marine Transportation; Planning and Forecasting; Terminals and Facilities;

Filing Info

• Accession Number: 01684316
• Record Type: Publication
• Files: TRIS
• Created Date: Oct 26 2018 10:34AM