Please use this identifier to cite or link to this item:
http://hdl.handle.net/10609/81971
Title: | Búsqueda de puntos débiles en redes de comunicaciones mediante algoritmos metaheurísticos |
Author: | Pérez Peló, Sergio |
Tutor: | Rivera Guevara, Richard |
Others: | Universitat Oberta de Catalunya |
Abstract: | This TFM will address the problem of finding a minimum spacer in generic networks using metaheuristic algorithms. This type of algorithms are capable of obtaining high quality solutions, requiring reduced execution times, but without guaranteeing the optimality of the solution found. Specifically, the Variable Neighborhood Search (VNS) methodology will be used, which is based on systematic neighborhood changes to escape local optima. |
Keywords: | metaheuristics variable neighborhood search network communication alpha separator |
Document type: | info:eu-repo/semantics/masterThesis |
Issue Date: | Jun-2018 |
Publication license: | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Appears in Collections: | Trabajos finales de carrera, trabajos de investigación, etc. |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
sperez0TFM0618memoria.pdf | Memoria del TFM | 2,04 MB | Adobe PDF | View/Open |
Share:
This item is licensed under a Creative Commons License