Skip to content

Tabu Search implementation for the Knapsack problem.

Notifications You must be signed in to change notification settings

lucianoSF/KNP-TS

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

KNP-TS

Tabu Search implementation for the Knapsack problem.

This repository contains the implementation for both, the TABU Search metaheurístic and the optimal approach to solve the Knapsack problem.

The instances used in this work, are adaptations of the instances found in this:

http://artemisa.unicauca.edu.co/~johnyortega/instances_01_KP/

Also for the otimization model, it was considered the formulation found in the follow:

https://personal.utdallas.edu/~scniu/OPRE-6201/documents/DP3-Knapsack.pdf

SA Convergence

Comparison