1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 HEAL.Attic;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Data;
|
---|
28 | using HeuristicLab.Optimization;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Analysis.FitnessLandscape {
|
---|
31 | [Item("Adaptive Walk Calculator", "Calculates characteristics from an adaptive walk.")]
|
---|
32 | [StorableType("C7E8743D-572E-43DC-A4F3-8044CA4E412E")]
|
---|
33 | public sealed class AdaptiveWalkCalculator : AlgorithmCharacteristicCalculator<AdaptiveWalk> {
|
---|
34 |
|
---|
35 | [StorableConstructor]
|
---|
36 | private AdaptiveWalkCalculator(StorableConstructorFlag _) : base(_) { }
|
---|
37 | private AdaptiveWalkCalculator(AdaptiveWalkCalculator original, Cloner cloner)
|
---|
38 | : base(original, cloner) { }
|
---|
39 | public AdaptiveWalkCalculator() : this(new AdaptiveWalk()) { }
|
---|
40 | public AdaptiveWalkCalculator(AdaptiveWalk walker) : base(walker) {
|
---|
41 | characteristics = new CheckedItemList<StringValue>(
|
---|
42 | new[] { "AutoCorrelation1", "CorrelationLength", "InformationContent",
|
---|
43 | "PartialInformationContent", "DensityBasinInformation", "InformationStability",
|
---|
44 | "Diversity", "Regularity", "TotalEntropy", "PeakInformationContent",
|
---|
45 | "PeakDensityBasinInformation" }.Select(x => new StringValue(x)));
|
---|
46 | }
|
---|
47 |
|
---|
48 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
49 | return new AdaptiveWalkCalculator(this, cloner);
|
---|
50 | }
|
---|
51 |
|
---|
52 | public override bool CanCalculate() {
|
---|
53 | return base.CanCalculate() && Problem.Operators.Any(x => x is IManipulator);
|
---|
54 | }
|
---|
55 |
|
---|
56 | public override IEnumerable<IResult> Calculate() {
|
---|
57 | foreach (var result in base.Calculate())
|
---|
58 | yield return new Result("AdaptiveWalk." + Algorithm.MutatorParameter.Value.Name + "." + result.Name, result.Value);
|
---|
59 | }
|
---|
60 | }
|
---|
61 | }
|
---|