Optimizing Transport Routing using Travelling Salesman Problem

This paper focuses on the application of the Travelling Salesman Problem algorithm in calculating the shortest path to connect the top 29 most populated cities in the Western Sahara. With the world population continuously growing, it has become necessary to find efficient and effective solutions to connect different regions. The paper highlights the importance of the design and analysis of algorithms in solving real-life problems. The proposed algorithm in this paper aims to solve the problem of finding the optimal route to connect the 29 cities in the Western Sahara, which can be extended to other similar scenarios. The paper provides insights into the design and analysis of the proposed algorithm and its effectiveness in finding the shortest path