Files

code.rar (22.91 KB)
tfg_nogales_gine_roger.pdf (551.03 KB)

Document type

Bachelor thesis

Publication date

2022-01-25

Publication license

cc-by-nc-nd (c) Roger Nogales Giné, 2022
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/186678

Different approaches to Travelling Salesman Problem

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

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.

Description

Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Eloi Sans Gispert

Subject

Algorismes computacionals, Treballs de fi de grau, Optimització combinatòria, Teoria de grafs

Subject (English)

Computer algorithms, Bachelor's theses, Combinatorial optimization, Graph theory

Citation

Collections

Treballs Finals de Grau (TFG) - Matemàtiques
Programari - Treballs de l'alumnat

Citation

NOGALES GINÉ, Roger. Different approaches to Travelling Salesman Problem. [consulted: 17 of June of 2026]. Available at: https://hdl.handle.net/2445/186678

Export metadata

JSON - METS

Share record