Repositorio interactivo para facilitar el aprendizaje de algoritmos heurísticos aplicados a problemas de optimización

Abstract

Algorithmics is one of the main branches of learning in the studies of a Graduate on Computer Engineering, because it allows to address the resolution of a huge amount of problems on an automated way. (Meta)heuristics are approximate techniques aimed at solving optimization problems by means of a reduce number of computational resources. This allows they can solve high complex optimization problems. The present work exposes the repository created with the goal to explain the set of heuristic algorithms with more use in the resolution of different types of problems, and that are frequently taugh in the subjects that compose the Grade on Computer Engineering. With the idea of complement the understanding of the algorithms, the repository includes a set of optimization problems highly studied in the literature, in such a way that the student can learn the behaviour of the available algorithms in problems with different characteristics. In addition to a detailed explanation of the heuristic algorithms as well the optimization problems, a set interactive examples of execution are included, on which an analysis of results can be carried out as well as a comparison between them. The idea is to encourage the interaction of the student in learning, through a step-by-step execution of different algorithm examples using a specific software, getting the student to understand in depth the different algorithms, their characteristics and their possible uses