Route planning and optimization for cargo delivery

Community Detection and finding the shortest distance in a community has been one of the hottest topics for years as it can provide certain advantages in many different disciplines such as computer science, biology, chemistry, geography. Today, due to the rapid growth of the logistics industry and the fact that it plays an important role in our lives, the fastest and most effective delivery of products is one of the most important issues that companies want to achieve. The Traveling Salesman Problem, which has been studied in the literature before, can be shown as the most well-known example of this. Within the scope of the thesis study, previous studies on this problem were examined in the literature. Shortest path finding algorithms were applied to the communities created by using the Louvain algorithm. In addition, the shortest distance between the formed communities was calculated with the shortest path finding algorithms and the results were compared. With this application, known as the Divide and Conquer method, it was observed that the performance of the algorithms improved between the state of the graph before the ensemble detection and the state after the ensemble detection. It has been observed that the performance of reaching the optimum result increases with this method.