38 | | || !BestSolution || || |
39 | | || !MaxTimeSteps || || |
40 | | || Quality || || |
41 | | || Results || The result collection where the value should be stored. || |
42 | | || !SymbolicExpressionTree || || |
43 | | || World || || |
| 38 | || !BestSolution || The visual representation of the best ant trail. || |
| 39 | || !MaxTimeSteps || The maximal time steps that the artificial ant has available to collect all food items. || |
| 40 | || Quality || The qualities of the artificial ant solutions which should be visualized. || |
| 41 | || Results || The result collection where the best artificial ant solution should be stored. || |
| 42 | || !SymbolicExpressionTree || The artificial ant solutions from which the best solution should be visualized. || |
| 43 | || World || The world with food items for the artificial ant. || |
51 | | || !BestKnownQuality || || |
52 | | || !BestKnownSolution || || |
53 | | || !BestSolution || || |
54 | | || !BinaryVector || || |
55 | | || !KnapsackCapacity || || |
56 | | || Maximization || || |
57 | | || Quality || || |
58 | | || Results || The result collection where the value should be stored. || |
59 | | || !SymbolicExpressionTree || || |
60 | | || Values || || |
61 | | || Weights || || |
| 51 | || !BestKnownQuality || The quality of the best known solution. || |
| 52 | || !BestKnownSolution || The best known solution. || |
| 53 | || !BestSolution || The best knapsack solution. || |
| 54 | || !BinaryVector || The knapsack solutions from which the best solution should be visualized. || |
| 55 | || !KnapsackCapacity || Capacity of the Knapsack. || |
| 56 | || Maximization || True if the problem is a maximization problem. || |
| 57 | || Quality || The qualities of the knapsack solutions which should be visualized. || |
| 58 | || Results || The result collection where the knapsack solution should be stored. || |
| 59 | || Values || The values of the items. || |
| 60 | || Weights || The weights of the items. || |
69 | | || !BestKnownQuality || || |
70 | | || !BestKnownSolution || || |
71 | | || !BinaryVector || || |
72 | | || Maximization || || |
73 | | || Quality || || |
74 | | || Results || The result collection where the value should be stored. || |
| 68 | || !BestKnownQuality || The quality of the best known solution. || |
| 69 | || !BestKnownSolution || The best known solution. || |
| 70 | || !BinaryVector || The Onemax solutions from which the best solution should be visualized. || |
| 71 | || Maximization || True if the problem is a maximization problem. || |
| 72 | || Quality || The qualities of the Onemax solutions which should be visualized. || |
| 73 | || Results || The result collection where the Onemax solution should be stored. || |