OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Genetic Algorithm, Simulated Annealing, Tabu Search, Iterated ...

Abstract: This is a research project on using Genetic Algorithm to solve 0-1 Knapsack Problem. Knapsack problem is a combinational optimization problem. Given a set of items, each with a weight & ...

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.

What makes an athlete great? The age old question continues to tease the sporting world. As science makes significant strides in the understanding of our genetic information, the search for the ...

Abstract: In this paper we used a genetic algorithm with learning capabilities to approach a problem that is NP-hard by definition known as the Knapsack problem. The experiments made showed that a ...