The algorithm has problems with the knapsack problem, if the amount of items is high (100) and the capacity is low (20).
Because of the random creation and change, the propability, that there is a solution which have a weight under the capacity is not likely and almost not happen.
It helps to add initial (predefined) population (solutions) but it still seems like that the algorithm not works well in this case, because of the propabilities.
The question is:
Can this problem solved in changing parts of the GA algorithm
Is the problem caused of the nature of the GA algorithm? -> no changes to make
Can this problem adressed by changing the implementation of Knappsack
-> calculate_fitness, get_random_param_value
How often does this issue occur? By many problems?
The algorithm has problems with the knapsack problem, if the amount of items is high (100) and the capacity is low (20). Because of the random creation and change, the propability, that there is a solution which have a weight under the capacity is not likely and almost not happen.
It helps to add initial (predefined) population (solutions) but it still seems like that the algorithm not works well in this case, because of the propabilities.
The question is: