1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 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 System.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HEAL.Attic;
|
---|
29 | using HeuristicLab.Selection;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Algorithms.RAPGA {
|
---|
32 | /// <summary>
|
---|
33 | /// A selection operator which considers a single solution representation and selects duplicates.
|
---|
34 | /// </summary>
|
---|
35 | /// <remarks>
|
---|
36 | /// The remaining scope then contains unique solutions and the selected scope their duplicates.
|
---|
37 | /// </remarks>
|
---|
38 | [Item("DuplicatesSelector", "A selection operator which considers a single solution representation and selects duplicates. The remaining scope then contains unique solutions and the selected scope their duplicates.")]
|
---|
39 | [StorableType("08446059-0FB3-4B20-9D70-B73F2EEC2AAF")]
|
---|
40 | public sealed class DuplicatesSelector : SingleObjectiveSelector {
|
---|
41 | public IValueLookupParameter<ISolutionSimilarityCalculator> SimilarityCalculatorParameter {
|
---|
42 | get { return (IValueLookupParameter<ISolutionSimilarityCalculator>)Parameters["SimilarityCalculator"]; }
|
---|
43 | }
|
---|
44 |
|
---|
45 | [StorableConstructor]
|
---|
46 | private DuplicatesSelector(StorableConstructorFlag _) : base(_) { }
|
---|
47 | private DuplicatesSelector(DuplicatesSelector original, Cloner cloner) : base(original, cloner) { }
|
---|
48 | public DuplicatesSelector()
|
---|
49 | : base() {
|
---|
50 | Parameters.Add(new ValueLookupParameter<ISolutionSimilarityCalculator>("SimilarityCalculator", "The similarity calculator that should be used to calculate solution similarity."));
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
54 | return new DuplicatesSelector(this, cloner);
|
---|
55 | }
|
---|
56 |
|
---|
57 | [StorableHook(HookType.AfterDeserialization)]
|
---|
58 | private void AfterDeserialization() {
|
---|
59 | // BackwardsCompatibility3.3
|
---|
60 | #region Backwards compatible code, remove with 3.4
|
---|
61 | if (!Parameters.ContainsKey("SimilarityCalculator"))
|
---|
62 | Parameters.Add(new ValueLookupParameter<ISolutionSimilarityCalculator>("SimilarityCalculator", "The similarity calculator that should be used to calculate solution similarity."));
|
---|
63 | #endregion
|
---|
64 | }
|
---|
65 |
|
---|
66 | protected override IScope[] Select(List<IScope> scopes) {
|
---|
67 | bool copy = CopySelected.Value;
|
---|
68 |
|
---|
69 | var marks = new bool[scopes.Count];
|
---|
70 | for (int i = 0; i < scopes.Count; i++)
|
---|
71 | for (int j = i + 1; j < scopes.Count; j++)
|
---|
72 | marks[j] = SimilarityCalculatorParameter.ActualValue.Equals(scopes[i], scopes[j]);
|
---|
73 |
|
---|
74 |
|
---|
75 | var selected = new IScope[marks.Count(x => x)];
|
---|
76 | int k = 0;
|
---|
77 | if (copy) {
|
---|
78 | for (int i = 0; i < scopes.Count; i++)
|
---|
79 | if (marks[i]) {
|
---|
80 | selected[k++] = (IScope)scopes[i].Clone();
|
---|
81 | }
|
---|
82 | } else {
|
---|
83 | for (int i = 0; i < scopes.Count; i++)
|
---|
84 | if (marks[i]) {
|
---|
85 | selected[k++] = scopes[i];
|
---|
86 | scopes[i] = null;
|
---|
87 | }
|
---|
88 | scopes.RemoveAll(x => x == null);
|
---|
89 | }
|
---|
90 |
|
---|
91 | return selected;
|
---|
92 | }
|
---|
93 | }
|
---|
94 | }
|
---|