MPE-FEUP - Travelling Salesman Challenge

This repository contains the project for Planning and Scalling Methods (MPE) of the Faculty of Engineerring of the University of Porto (FEUP).

Problem

The challenge chosen for this project was the Travelling Salesman Challenge. It involves calculating a solution for the Travelling Salesman Problem (TSP) for a great number of cities in just 30 seconds.

Folder structure

• docs contains documents with relevant information about TSP and the final project scientific article.
• TSP contains the Java application used to solve the challenge.

Authors

• Diogo Duque
• José Aleixo