THE TRAVELLING SALESMAN PROBLEM IN THE FUNCTION OF TRANSPORT NETWORK OPTIMALIZATION

The fundamental objective and purpose of this paper is to analyze the Travelling Salesman Problem (TSP) as a function of forming and optimizing transport networks. There are several software solutions for solving such problems, based on a heuristic algorithm. In practical application, the starting point consists of algorithms with solutions close to the optimum, or at least those with one optimal solution. Accordingly, the basic assumption of this paper is to use object modelling and programming in the spreadsheet interface (VBA for Excel), of which detailed analysis shows more than one optimal solution that could be used to create a flexible and adaptive transport network.