The Exhaustive Search Algorithm in the Transport network optimization on the example of Urban Agglomeration Rijeka

The paper presents the use of Exhaustive Search Algorithm and model of Traveling Salesman Problem (TSP) in the transport network optimization, on the example of Urban Agglomeration Rijeka. The aim is optimal routing design between cities and municipalities of Urban Agglomeration Rijeka. In creating of Urban Agglomeration Rijeka has been defined the criteria of sustainability of transport and infrastructure systems covering the most important existing and planned economic zones, infrastructure buildings and traffic hubs (rail, highway, port, airport), located in cities and municipalities in the wider Rijeka area. The transport network of Urban Agglomeration Rijeka should provide optimal supply of cities, municipalities, and their distribution centers in the area of agglomeration. Choosing the relevant information technology and computer software to enable us to create optimal node connections (cities, distribution centres, ports, and terminals), and arrange the optimal transportation routes, is the key factor of transportation network modelling for an effective distribution of goods.Visual and object-oriented methods of modelling and programming allows us to use and visualize the Exhaustive Search Algorithm in the transport network optimization, in the way to identify multiple optimal solutions with a clear interpretation of the results not only of the optimal value but also at approximately equal values and their deviations from the optimal value. Given that Urban Agglomeration Rijeka covers 10 cities and municipalities, Exhaustive Search Algorithm is suitable for designing the transport network. In making the program based on the Exhaustive Search Algorithm have been used Visual Basic for Application in Excel spreadsheet interface. The Exhaustive Search Algorithm, with the calculation of the optimal relation, also allows the calculation of suboptimal relations whose values within an acceptable deviation from the optimal value. The calculation and insight into the more optimum relationships can significantly support the reduction of transport costs, but also the creation of greater opportunities for the carrier with the more flexible design of the structure of goods flows and gaining more profit.