Travelling Salesman Problem - TSP

Travelling Salesman Problem (TSP) Project:

I developed a project to solve the well-known Travelling Salesman Problem (TSP), one of the most recognized challenges in algorithm design and artificial intelligence, using C++ with an interactive graphical user interface (GUI).

The project aims to find the shortest possible route that allows a salesman to visit each city exactly once and return to the starting point, which is essential for optimizing routes, reducing costs, and has real-world applications in logistics, transportation, and network design.

Key Features of the Project:

An interactive graphical interface displaying a map of Egyptian cities.

Allows users to define the number and locations of cities.

Calculates and visualizes the optimal route that covers all cities and returns to the starting point.

Utilizes AI techniques and optimization algorithms to determine the most efficient route with minimal cost