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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Petr Chládek (Autor:in) / Dana Smetanová (Autor:in)


    Erscheinungsdatum :

    2018




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    On the Discretized Dubins Travelling Salesman Problem

    Epstein, C. / Cohen, I. / Shima, T. et al. | British Library Conference Proceedings | 2014


    Intuitionistic Fuzzy Modeling to Travelling Salesman Problem

    Garai, Arindam / Roy, Tapan Kumar | BASE | 2013

    Freier Zugriff


    Hybrid ABC/PSO to solve travelling salesman problem

    Yang, Weihong / Pei, Zhili | British Library Online Contents | 2013


    Hybrid ABC/PSO to solve travelling salesman problem

    Yang, W. / Pei, Z. | British Library Online Contents | 2013