Hybrid-IGA-SA-Knapsack

An implementation of the hybrid genetic and simulated annealing (IGA-SA) algorithm applied to the knapsack 0-1 problem

Hybrid Algorithm based on the algorithm presented in this paper

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
OptimalSolution		OptimalSolution
Plots		Plots
Results		Results
TestDataset		TestDataset
Algorithms.py		Algorithms.py
AnnealingFunctions.py		AnnealingFunctions.py
App.py		App.py
Genetic Algorithm_Results.csv		Genetic Algorithm_Results.csv
GeneticAlgorithm.py		GeneticAlgorithm.py
GeneticAnnealing.py		GeneticAnnealing.py
GeneticFunctions.py		GeneticFunctions.py
Hybrid IGA-SA_Results.csv		Hybrid IGA-SA_Results.csv
Hybrid [Python].csv		Hybrid [Python].csv
KnapSack.py		KnapSack.py
README.md		README.md
Simulated Annealing_Results.csv		Simulated Annealing_Results.csv
SimulatedAnnealing.py		SimulatedAnnealing.py
main.py		main.py
unknown_support.py		unknown_support.py
utilities.py		utilities.py

Provide feedback