| | 1 | = Knapsack Problem = |
| | 2 | |
| | 3 | '''Problem Parameters:''' |
| | 4 | ||= Parameter =||= Description =|| |
| | 5 | || !BestKnownQuality || The quality of the best known solution of this artificial ant instance. || |
| | 6 | || !BestKnownSolution || The best known solution of this Knapsack instance. || |
| | 7 | || Evaluator || !KnapsackEvaluator: The operator which should be used to evaluate Knapsack solutions. || |
| | 8 | || !KnapsackCapacity || Capacity of the Knapsack. || |
| | 9 | || Maximization || Set to true as the Knapsack Problem is a maximization problem. || |
| | 10 | || Penalty || The penalty value for each unit of overweight. || |
| | 11 | || !SolutionCreator || !RandomBinaryVectorCreator: The operator which should be used to create new Knapsack solutions. || |
| | 12 | || Values || The values of the items. || |
| | 13 | || Weights || The weights of the items. || |
