Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/117786
Title: Optimización de rutas de distribución de bicicletas entre las estaciones de BiciMAD aplicando el algoritmo de la colonia de hormigas
Author: Hidalgo Boix, Ana
Director: Ventura Royo, Carles  
Tutor: Isern Alarcón, David
Keywords: ant colony optimization
optimization
graphs
Issue Date: Jun-2020
Publisher: Universitat Oberta de Catalunya (UOC)
Abstract: The main purpose of this research paper is to find the best route for restoring the bicicles in all of the BiciMAD stations. In order to do so, the Ant Colony Optimization algorithm is chosen, on the grounds that it's known to work well with route optimization problems. This algorithm, as well as other non ACO solutions developed for evaluation purposes, is coded in Python using as a data set a CSV file containing all the BiciMAD stations for June 2018. The comparative analysis of the results of both, ACO and non ACO solutions, shows that the Ant Colony Optimization algorithm finds shorter and thus, better routes. In conclusion, the ACO algorithm developed for this paper proves to be suitable and effective to solve this problem.
Language: Spanish
URI: http://hdl.handle.net/10609/117786
Appears in Collections:Bachelor thesis, research projects, etc.

Share:
Export:
Files in This Item:
File Description SizeFormat 
ahboixTFG0620memoria.pdfMemoria del TFG1.08 MBAdobe PDFView/Open
ahboixTFG0620presentación.pdfPresentació del TFG2.18 MBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons