Model of Using the Exhaustive Search Algorithm in Solving of Traveling Salesman Problem (TSP) on the Example of the Transport Network Optimization of Primorje-Gorski Kotar County (PGC)
Model of Using the Exhaustive Search Algorithm in Solving of Traveling Salesman Problem (TSP) on the Example of the Transport Network Optimization of Primorje-Gorski Kotar County (PGC)

Summary/Abstract: This paper considers and presents a model of the use of an exhaustive search algorithm in solving problems of a salesman on the example of the transportation network optimization of Primorsko Goranska County. By identifying the suboptimal solutions of the transportation network, that enables insight into more transportation routes and can be significantly influenced by the reduction of transportation costs and creating increased opportunities for the carrier in the context of flexible designing the structure of the commodity flows, greater utilization of transport capacity, and thus achieve greater profit. In the analyzed example, the transportation network of Primorje-Gorski Kotar County (PGC) is divided into two sets (segment): 1) a set of cities (nodes) that are located (placed) on the same traffic direction (transportation route) that represents the optimal transportation route, and 2) a set of cities (nodes) that connect through a variety of transport relationships and that are included in the calculation by using the exhaustive search algorithm. In the example are also defined nodes that are common to both the two sets and that are connecting by the virtual transportation route in the spreadsheet optimization model.

• Details
• Contents