Abstract: This study analyses and compares the performance of six heuristic algorithms: Genetic Algorithm (GA), Simulated Annealing (SA), Hybrid (SA+GA), Tabu Search (TS), Ant Colony Optimization (ACO ...
Abstract: The Unbounded Knapsack Problem (UKP), as an important extension of the classical 0-1 knapsack problem, is an NP-hard combinatorial optimization problem characterized by its allowance for ...
The current genetic algorithm for the knapsack problem uses basic single-point crossover, fixed mutation, and zero-fitness penalty for overweight solutions. This leads to slow convergence and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback