Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/186678| Title: | Different approaches to Travelling Salesman Problem |
| Author: | Nogales Giné, Roger |
| Director/Tutor: | Sans Gispert, Eloi |
| Keywords: | Algorismes computacionals Treballs de fi de grau Optimització combinatòria Teoria de grafs Computer algorithms Bachelor's theses Combinatorial optimization Graph theory |
| Issue Date: | 25-Jan-2022 |
| Abstract: | [en] This thesis is a comparison of some to solve the Travelling Salesman Problem. The approach for the analysis by coding and compering the result. Starting with the most primitive Brute Force Algorithm and going through more creative and innovative ones, there is presented how do they work, a pseudo-code the mathematical theory hidden behind each of them. The objective is to compare and evaluate the pros and cons on different scenarios of the Salesman Travelling Problem. |
| Note: | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Eloi Sans Gispert |
| URI: | http://hdl.handle.net/2445/186678 |
| Appears in Collections: | Programari - Treballs de l'alumnat Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| code.rar | Codi font | 22.91 kB | Unknown | View/Open |
| tfg_nogales_gine_roger.pdf | Memòria | 551.03 kB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License
