#region License Information /* HeuristicLab * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using System.Linq; using HEAL.Attic; using HeuristicLab.Analysis; using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Data; using HeuristicLab.Optimization; using HeuristicLab.Optimization.Operators; using HeuristicLab.Parameters; namespace HeuristicLab.Encodings.BinaryVectorEncoding { [StorableType("2F6FEB34-BD19-47AF-9484-7F48565C0C43")] public abstract class BinaryVectorProblem : SingleObjectiveProblem { [Storable] protected IResultParameter> BestResultParameter { get; private set; } public IResultDefinition> BestResult => BestResultParameter; [Storable] protected ReferenceParameter DimensionRefParameter { get; private set; } public int Dimension { get { return Encoding.Length; } set { Encoding.Length = value; } } [StorableConstructor] protected BinaryVectorProblem(StorableConstructorFlag _) : base(_) { } [StorableHook(HookType.AfterDeserialization)] private void AfterDeserialization() { RegisterEventHandlers(); } protected BinaryVectorProblem(BinaryVectorProblem original, Cloner cloner) : base(original, cloner) { BestResultParameter = cloner.Clone(original.BestResultParameter); DimensionRefParameter = cloner.Clone(original.DimensionRefParameter); RegisterEventHandlers(); } protected BinaryVectorProblem() : this(new BinaryVectorEncoding() { Length = 10 }) { } protected BinaryVectorProblem(BinaryVectorEncoding encoding) : base(encoding) { EncodingParameter.ReadOnly = true; Parameters.Add(BestResultParameter = new ResultParameter>("Best Solution", "The best solution.")); Parameters.Add(DimensionRefParameter = new ReferenceParameter("Dimension", "The dimension of the binary vector problem.", Encoding.LengthParameter)); Operators.Add(new HammingSimilarityCalculator()); Operators.Add(new QualitySimilarityCalculator()); Operators.Add(new PopulationSimilarityAnalyzer(Operators.OfType())); Parameterize(); RegisterEventHandlers(); } public override void Analyze(ISingleObjectiveSolutionContext[] solutionContexts, ResultCollection results, IRandom random) { var best = GetBest(solutionContexts); var currentBest = BestResultParameter.ActualValue; if (currentBest == null || IsBetter(best.EvaluationResult.Quality, currentBest.EvaluationResult.Quality)) BestResultParameter.ActualValue = (ISingleObjectiveSolutionContext)best.Clone(); } private void Parameterize() { foreach (var similarityCalculator in Operators.OfType()) { similarityCalculator.SolutionVariableName = Encoding.Name; similarityCalculator.QualityVariableName = Evaluator.QualityParameter.ActualName; } } private void RegisterEventHandlers() { Encoding.PropertyChanged += (sender, args) => { if (args.PropertyName == nameof(Encoding.Length)) DimensionOnChanged(); }; } protected virtual void DimensionOnChanged() { } } }