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.


    Access

    Download


    Export, share and cite



    Title :

    ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS


    Contributors:


    Publication date :

    2018




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Some aspects of the aerodynamics of STOL ports

    Blanton, J. N. / Grunwald, K. J. / Parker, H. M. | NTRS | 1971


    Optimal Use of Container Ships for Servicing Among Small Ports

    Srećko Krile / Darijo Mišković | DOAJ | 2018

    Free access

    Ports in Theory

    Talley, Wayne K. | Wiley | 2012


    Some aspects of marine reactor safety

    Maddocks, K. | Engineering Index Backfile | 1959


    Information engineering for ports and marine environments

    Mu, Lin / Wang, Lizhe / Wang, Mingwei | TIBKAT | 2020