ON SOME ASPECTS OF GRAPH THEORY FOR OPTIMAL TRANSPORT AMONG MARINE PORTS
Journal: Scientific Journal of Silesian University of Technology. Series Transport (Vol.101, No. 10)Publication Date: 2018-12-01
Authors : Petr CHLÁDEK Dana SMETANOVÁ Srećko KRILE;
Page : 37-45
Keywords : Travelling Salesman Problem; graph theory; minimum spanning tree; marine ports;
Abstract
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.
Other Latest Articles
- TEETH GEOMETRY AND CONTACT PRESSURE CALCULATION OF EXTERNAL CYCLOIDAL GEARS
- MODEL OF THE TACTICAL AIRCRAFT OPERATING SYSTEM AS AN AGGREGATED ANALYSIS DOMAIN FOR HAZARD RISK MANAGEMENT PROCESSES
- URBAN GROWTH AND SPATIAL DEVELOPMENT ALONG TRANSPORT CORRIDORS IN DUJAIL MUNICIPALITY
- DIRECTIONS IN THE MODERNIZATION OF MODERN SEAPORTS
- SHIP INFORMATION SYSTEMS USING SMARTGLASSES TECHNOLOGY
Last modified: 2019-05-31 18:20:29