Skip to content

Latest commit

 

History

History
6 lines (5 loc) · 693 Bytes

README.md

File metadata and controls

6 lines (5 loc) · 693 Bytes
Raw

Decision Theory course - TSP Problem

This repository has the project implemented at the decision theory course at UFMG semester 2019/2. The project is to solve the TSP problem with 250 cities using the Simulated annealing (SA) metaheuristic algorithm, and then using the decision theory algorithms AHP, ELECTRE I, and PROMETHEE II to choose the best solution.

  • TC 1 folder: Solves the TSP Problem as a mono-objective problem for distance and time between cities.
  • TC 2 folder: Solves the TSP Problem as a multi-objective problem for distance and time between cities.
  • TC 3 folder: Choosing the best solution using the three decision theory algorithms: AHP, ELECTRE I, and PROMETHEE II.