| 12 | A pre-defined evolution strategy which solves the 10-dimensional [TestFunctions#GriewankFunction Griewank test function]. HeuristicLab 3 provides a set of real valued test functions for benchmarking purposes. For a full overview please go the [TestFunctions Test Functions] wiki page. |
| 13 | |
| 14 | '''Algorithm:''' Evolution Strategy |
| 15 | |
| 16 | '''Algorithm Parameters:''' |
| 17 | * Population Size: 20 |
| 18 | * Children: 500 |
| 19 | * !MaximumGenerations: 200 |
| 20 | * !ParentsPerChild: 5 |
| 21 | * !PlusSelection: False (Comma Selection) |
| 22 | * Recombinator: !AverageCrossover |
| 23 | * Mutator: !NormalAllPositionsManipulator |
| 24 | |
| 25 | '''Problem:''' Single Objective Test Function |
| 26 | |
| 27 | '''Problem Parameters:''' |
| 28 | * !BestKnownQuality: 0 |
| 29 | * !BestKnownSolution: [0;0;0;0;0;0;0;0;0;0] |
| 30 | * Bounds: [-600, 600] |
| 31 | * Evaluator: !GriewankEvaluator |
| 32 | * Maximization: False |
| 33 | * !ProblemSize: 10 |
| 34 | * !SolutionCreator: !UniformRandomRealVectorCreator |
| 35 | |
| 38 | This sample demonstrates how to employ a genetic algorithm to optimize a travelling salesman problem instance, namely "ch130" from the [http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/ TSP Lib]. |
| 39 | |
| 40 | '''Algorithm:''' Genetic Algorithm |
| 41 | |
| 42 | '''Algorithm Parameters:''' |
| 43 | * !PopulationSize: 100 |
| 44 | * Elites: 1 |
| 45 | * !MutationProbability: 5% |
| 46 | * !MaximumGenerations: 1000 |
| 47 | * Selector: !ProportionalSelector |
| 48 | * Crossover: Crossover2 (cf. Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. p. 135) |
| 49 | * Mutator: !InversionManipulator |
| 50 | |
| 51 | '''Problem:''' Single Objective Test Function |
| 52 | |
| 53 | '''Problem Parameters:''' |
| 54 | * !BestKnownQuality: 6110 |
| 55 | * !BestKnownSolution: The best known solution of this TSP instance (cf. TSP Lib) |
| 56 | * Coordinates: The x and y coordinates of the cities |
| 57 | * Evaluator: !TSPRoundedEuclideanPathEvaluator |
| 58 | * Maximization: False |
| 59 | * !SolutionCreator: !RandomPermutationCreator |
| 60 | * !UseDistanceMatrix: True |