CHLÁDEK, Petr, Dana SMETANOVÁ a Srećko KRILE. ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS. Scientific Journal of Silesian University of Technology. Series Transport. Katowice, Poland: Faculty of Transport of Silesian University of Technology. Silesian University of Technology, 2018, roč. 101, č. 2018, s. 37-45. ISSN 0209-3324. Dostupné z: https://dx.doi.org/10.20858/sjsutst.2018.101.4. |
Další formáty:
BibTeX
LaTeX
RIS
@article{49441, author = {Chládek, Petr and Smetanová, Dana and Krile, Srećko}, article_location = {Katowice, Poland}, article_number = {2018}, doi = {http://dx.doi.org/10.20858/sjsutst.2018.101.4}, keywords = {Travelling Salesman Problem; graph theory; minimum spanning tree; marine ports}, language = {eng}, issn = {0209-3324}, journal = {Scientific Journal of Silesian University of Technology. Series Transport}, title = {ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS}, url = {http://sjsutst.polsl.pl/archives/2018/vol101/037_SJSUTST101_2018_Chladek_Smetanova_Krile.pdf}, volume = {101}, year = {2018} }
TY - JOUR ID - 49441 AU - Chládek, Petr - Smetanová, Dana - Krile, Srećko PY - 2018 TI - ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS JF - Scientific Journal of Silesian University of Technology. Series Transport VL - 101 IS - 2018 SP - 37-45 EP - 37-45 PB - Faculty of Transport of Silesian University of Technology. Silesian University of Technology SN - 02093324 KW - Travelling Salesman Problem KW - graph theory KW - minimum spanning tree KW - marine ports UR - http://sjsutst.polsl.pl/archives/2018/vol101/037_SJSUTST101_2018_Chladek_Smetanova_Krile.pdf L2 - http://sjsutst.polsl.pl/archives/2018/vol101/037_SJSUTST101_2018_Chladek_Smetanova_Krile.pdf N2 - This paper is devoted to the Travelling Salesman Problem as applied to Czechoslovak ocean shipping companies and their marine ports on the Black Sea. The shortest circular path around these ports is found and discussed. Formulation of the problem accounts for the fact that distances between the individual cities are not the same in both directions. The consequences that arise from this situation are studied. The used algorithms are based on graph theory and standard logistic methods. In addition, the results are compared with the results obtained by using a minimum spanning tree algorithm. ER -
CHLÁDEK, Petr, Dana SMETANOVÁ a Sre$\backslash$'cko KRILE. ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS. \textit{Scientific Journal of Silesian University of Technology. Series Transport}. Katowice, Poland: Faculty of Transport of Silesian University of Technology. Silesian University of Technology, 2018, roč.~101, č.~2018, s.~37-45. ISSN~0209-3324. Dostupné z: https://dx.doi.org/10.20858/sjsutst.2018.101.4.
|