López Pereira, Jorge MarioSarmiento, Andrés Felipe2021-11-252021-11-252021-11-25https://repositorio.unicordoba.edu.co/handle/ucordoba/4718The present project seeks to develop a metaheuristic for solving a variant of the Multiple Knapsack Problem, based on a recently developed metaheuristic for solving continuous domain optimization problems. To achieve this, an algorithm that has the logic behind the initial model was developed and new functions were added to make it work properly with the binary encoding of the decision variables of the problem. In order to make comparison, a couple of variants of the main model were designed and an experiment was built in which several runs were performed, with predefined and tested with other algorithms instances, in a random order for each variant, and finally get some descriptive data, GAP’s and average execution times. Results indicate a competent performance of the metaheuristics compared to exact algorithms like CPLEX, while it’s less competent compared to other metaheuristics developed previously for this type of optimization problems, in terms of both target value and execution time.Resumen .................................................................................................................... viiiAbstract.....................................................................................................................ixIntroducción ....................................................................................................1Objetivos..............................................................................................................3Objetivo General....................................................................................3Objetivos específicos..........................................................................3Revisión bibliográfica...............................................................................4Marco conceptual.................................................................................4Algoritmo...................................................................................................4Algoritmo de aproximaciónn.......................................................................4Algoritmos exactos.....................................................................................4Heurística..................................................................................................5Metaheurística...........................................................................................5Problema de la mochila.............................................................................5Problemas NP.............................................................................................6Problemas NP-Completo...........................................................................6Problemas P o tiempo polinómico............................................................6Valor k.....................................................................................................6Estado del arte ..............................................................................................7Problema de la mochila múltiple con configuración y metaheurística usadas ............................................................................7Metaheurística de fertilidad de suelos ...............................9Materiales y métodos ..............................................................................11Condiciones del trabajo ...............................................................11Desarrollo de la metaheurística ............................................11Lógica del algoritmo final .......................................................................12Prueba de parámetros......................................................................28Diseño experimentalL..........................................................................29Diseño de nuevas versiones ......................................................................29Selección de instancias s.............................................................................30Detalles adicionales del experimento ....................................................30Resultados y discusionesConclusiones.......................................................................32Recomendaciones.......................................................................................39Bibliografía ...................................................................................................41Anexos .........................................................................................................................44Anexo 1 Instancias utilizadas en formato Excel L.....................44Anexo 2 Scripts de las diferentes versiones de la metaheurística ..................44Anexo 3 Archivo con resultados del experimento ................45Anexo 4 Ejemplo numérico del algoritmo .................................45application/pdfspaCopyright Universidad de Córdoba, 2021Trabajo de grado - Pregradoinfo:eu-repo/semantics/openAccessAtribución-NoComercial-SinDerivadas 4.0 Internacional (CC BY-NC-ND 4.0)MetaheurísticaFertilidad de SuelosHeurística CorrectivaProblema de la MochilaMetaheuristicsFarmland FertilityCorrective HeuristicsMultiple Knapsack Problem