source: branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior.Analyzers/3.3/SolutionsCaching/PermutationSolutionDictionary.cs @ 9711

Last change on this file since 9711 was 9711, checked in by ascheibe, 7 years ago

#1886 started working on a solution cache

File size: 2.4 KB
Line 
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
22using System.Collections.Generic;
23using System.Linq;
24using HeuristicLab.Encodings.PermutationEncoding;
25
26namespace HeuristicLab.Analysis.AlgorithmBehavior.Analyzers {
27  public class PermutationSolutionDictionary<TKey, TValue> : SolutionDictionary<TKey, TValue>
28    where TKey : PermutationWrapper {
29
30    public PermutationSolutionDictionary() {
31      solutionDictionary = new Dictionary<TKey, List<TValue>>();
32    }
33
34    protected override void InsertKeyValue(TKey key, TValue value) {
35      int diffCnt;
36      Permutation p = key.GetPermutation();
37      Permutation ms = GetMostSimilarSolution(p, out diffCnt);
38
39      if (diffCnt < ms.Length / 2) {
40        key.StorePartialPermutation(ms, p);
41      }
42
43      var lst = new List<TValue>();
44      lst.Add(value);
45      solutionDictionary.Add(key, lst);
46    }
47
48    private Permutation GetMostSimilarSolution(Permutation permutation, out int diffCnt) {
49      Permutation result = null; int min = int.MaxValue;
50      foreach (PermutationWrapper p in solutionDictionary.Keys.Where(x => x.ElementType == ElementType.Complete)) {
51        Permutation pr = p.GetPermutation();
52        int diffs = CountDiffs(permutation, pr);
53        if (min < diffs) {
54          result = pr;
55          min = diffs;
56        }
57      }
58      diffCnt = min;
59      return result;
60    }
61
62    private int CountDiffs(Permutation x, Permutation y) {
63      int result = 0;
64      for (int i = 0; i < x.Length; i++) {
65        if (x[i] != y[i]) result++;
66      }
67      return result;
68    }
69  }
70}
Note: See TracBrowser for help on using the repository browser.