1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
4 | *
|
---|
5 | * This file is part of HeuristicLab.
|
---|
6 | *
|
---|
7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
8 | * it under the terms of the GNU General Public License as published by
|
---|
9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
10 | * (at your option) any later version.
|
---|
11 | *
|
---|
12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
15 | * GNU General Public License for more details.
|
---|
16 | *
|
---|
17 | * You should have received a copy of the GNU General Public License
|
---|
18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
19 | */
|
---|
20 | #endregion
|
---|
21 |
|
---|
22 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
23 | namespace HeuristicLab.Analysis.AlgorithmBehavior.Analyzers {
|
---|
24 | public class UnwantedMutationAnalyzer {
|
---|
25 | public static double AnalyzeUnwantedMutationsForPermutationEncoding(Permutation parent1, Permutation parent2, Permutation child) {
|
---|
26 | int cnt = 0;
|
---|
27 | int[] edgesP1 = CalculateEdgesVector(parent1);
|
---|
28 | int[] edgesP2 = CalculateEdgesVector(parent2);
|
---|
29 | int[] edgesC = CalculateEdgesVector(child);
|
---|
30 |
|
---|
31 | for (int i = 0; i < edgesP1.Length; i++) {
|
---|
32 | if (edgesC[i] != edgesP1[i] &&
|
---|
33 | edgesC[i] != edgesP2[i] &&
|
---|
34 | edgesP1[edgesC[i]] != i &&
|
---|
35 | edgesP2[edgesC[i]] != i) {
|
---|
36 | cnt += 1;
|
---|
37 | }
|
---|
38 | }
|
---|
39 |
|
---|
40 | return ((double)cnt) / parent1.Length;
|
---|
41 | }
|
---|
42 |
|
---|
43 | //copied from PermutationEqualityComparer
|
---|
44 | private static int[] CalculateEdgesVector(Permutation permutation) {
|
---|
45 | // transform path representation into adjacency representation
|
---|
46 | int[] edgesVector = new int[permutation.Length];
|
---|
47 | for (int i = 0; i < permutation.Length - 1; i++)
|
---|
48 | edgesVector[permutation[i]] = permutation[i + 1];
|
---|
49 | edgesVector[permutation[permutation.Length - 1]] = permutation[0];
|
---|
50 | return edgesVector;
|
---|
51 | }
|
---|
52 | }
|
---|
53 | }
|
---|