105 | | ''A description will follow shortly'' |
| 106 | |
| 107 | '''Algorithm:''' Island Genetic Algorithm |
| 108 | |
| 109 | '''Algorithm Parameters:''' |
| 110 | * Analyzer: !MultiAnalyzer |
| 111 | * Crossover: !OrderCrossover2 |
| 112 | * Elites: 1 |
| 113 | * !EmigrantsSelector: !BestSelector |
| 114 | * !ImmigrationReplacer: !WorstReplacer |
| 115 | * !IslandAnalyzer: !MultiAnalyzer |
| 116 | * !MaximumGenerations: 1000 |
| 117 | * !MigrationInterval: 50 |
| 118 | * !MigrationRate: 25% |
| 119 | * Migrator: !UnidirectionalRingMigrator |
| 120 | * !MutationProbability: 5% |
| 121 | * Mutator: !InversionManipulator |
| 122 | * !NumberOfIslands: 5 |
| 123 | * !PopulationSize: 100 |
| 124 | * Seed: - |
| 125 | * Selector: !ProportionalSelector |
| 126 | * !SetSeedRandomly: True |
| 127 | |
| 128 | |
| 129 | '''Problem:''' Travelling Salesman Problem |
| 130 | |
| 131 | '''Problem Parameters:''' |
| 132 | * !BestKnownQuality: 6110 |
| 133 | * !BestKnownSolution: The best known solution of this TSP instance (cf. TSP Lib) |
| 134 | * Coordinates: The x and y coordinates of the cities |
| 135 | * !DistanceMatrix: null |
| 136 | * Evaluator: !TSPRoundedEuclideanPathEvaluator |
| 137 | * Maximization: False |
| 138 | * !SolutionCreator: !RandomPermutationCreator |
| 139 | * !UseDistanceMatrix: True |