Traveling Salesman Problem

Traveling Salesman Problem implemented in C

Link: GitHub

Module: Algorithms and Data Structures

Graduation Year: 2

Determining workspace structure Deciding which workspace information to collect Gathering workspace info This project is a solution to the Traveling Salesman Problem (TSP), a classic algorithmic problem in the field of computer science and operations research. It focuses on optimization. In this problem, a salesman is given a list of cities, and must determine the shortest route that allows him to visit each city once and return to his original location.

The project is implemented in C and provides two different approaches to solve the problem: a brute force approach and a dynamic programming approach. The brute force solution is implemented in the bruteforce.c file.

The [cities.h file contains functions for managing city data, including creating new cities and calculating distances between cities. The project also includes a makefile for easy compilation and cleaning of the project.

The project also generates SVG maps of the best solutions found, which are saved in files named `min_*.svg` and `max_*.svg`.

The project's README file provides detailed instructions on how to compile and run the project.