Geographical information system based shortest route analysis in freight transportation

In our country, many problems arise with the increase in population. Increasing population and industrialization accelerate rural-urban migration and urbanization is increasing. As a result of all these, the service sector comes to the fore. The logistics sector is becoming important to meet people's needs in a correct and timely manner. In order for this important sector to be successful, resources such as products and services must be available at the desired time and where they are needed. In this study, a sample application is made based on the Traveling Salesman Problem (TSP), which is one of the important problems of the logistics industry. For example, freight transportation is carried out by choosing the shortest route among 81 Organized İndustrial Zones (OİZ), one from each province of our country. Freight transport is carried out using both one-way transport and multi-transport. The shortest route analysis is made with the Tabu Search (TA) algorithm used by the geographic information system ArcGIS. The result of this analysis is compared with the Genetic Algorithm (GA), Linear Optimization (LO) and Particle Swarm Optimization (PSO) methods. As a result of the analysis made using TA algorithm in ArcGIS program, the shortest route between 81 OİZ is 10277 km with one type of freight transportation and 10187 km with multi-type freight transportation. The results are observed that TA algorithm gives a worse result than the LO technique and a better result than the GA and PSO techniques.