#region License Information
/* HeuristicLab
* Copyright (C) 2002-2014 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;
using System.Collections.Generic;
using System.Linq;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Operators;
using HeuristicLab.Optimization;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.Analysis {
///
/// An operator that extracts (clones) the scope containing the best quality.
///
[Item("BestScopeSolutionAnalyzer", "An operator that extracts the scope containing the best quality.")]
[StorableClass]
public class BestScopeSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer {
public virtual bool EnabledByDefault {
get { return true; }
}
public LookupParameter MaximizationParameter {
get { return (LookupParameter)Parameters["Maximization"]; }
}
public ScopeTreeLookupParameter QualityParameter {
get { return (ScopeTreeLookupParameter)Parameters["Quality"]; }
}
public IFixedValueParameter BestSolutionResultNameParameter {
get { return (IFixedValueParameter)Parameters["BestSolution ResultName"]; }
}
public ILookupParameter BestKnownQualityParameter {
get { return (ILookupParameter)Parameters["BestKnownQuality"]; }
}
public IValueLookupParameter ResultsParameter {
get { return (IValueLookupParameter)Parameters["Results"]; }
}
public string BestSolutionResultName {
get { return BestSolutionResultNameParameter.Value.Value; }
set { BestSolutionResultNameParameter.Value.Value = value; }
}
#region Storing & Cloning
[StorableConstructor]
protected BestScopeSolutionAnalyzer(bool deserializing) : base(deserializing) { }
protected BestScopeSolutionAnalyzer(BestScopeSolutionAnalyzer original, Cloner cloner) : base(original, cloner) { }
public override IDeepCloneable Clone(Cloner cloner) {
return new BestScopeSolutionAnalyzer(this, cloner);
}
[StorableHook(HookType.AfterDeserialization)]
private void AfterDeserialization() {
if (!Parameters.ContainsKey("BestSolution ResultName"))
Parameters.Add(new FixedValueParameter("BestSolution ResultName", "The name of the result for storing the best solution.", new StringValue("Best Solution")));
}
#endregion
public BestScopeSolutionAnalyzer()
: base() {
Parameters.Add(new LookupParameter("Maximization", "True if the problem is a maximization problem."));
Parameters.Add(new ScopeTreeLookupParameter("Quality", "The qualities of the solutions."));
Parameters.Add(new FixedValueParameter("BestSolution ResultName", "The name of the result for storing the best solution.", new StringValue("Best Solution")));
Parameters.Add(new LookupParameter("BestKnownQuality", "The quality of the best known solution."));
Parameters.Add(new ValueLookupParameter("Results", "The result collection where the solution should be stored."));
}
public override IOperation Apply() {
ItemArray qualities = QualityParameter.ActualValue;
ResultCollection results = ResultsParameter.ActualValue;
bool max = MaximizationParameter.ActualValue.Value;
DoubleValue bestKnownQuality = BestKnownQualityParameter.ActualValue;
if (results.ContainsKey(BestSolutionResultName) && !typeof(IScope).IsAssignableFrom(results[BestSolutionResultName].DataType)) {
throw new InvalidOperationException(string.Format("Could not add best solution result, because there is already a result with the name \"{0}\" present in the result collection.", BestSolutionResultName));
}
int i = -1;
if (!max)
i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
else i = qualities.Select((x, index) => new { index, x.Value }).OrderByDescending(x => x.Value).First().index;
IEnumerable scopes = new IScope[] { ExecutionContext.Scope };
for (int j = 0; j < QualityParameter.Depth; j++)
scopes = scopes.SelectMany(x => x.SubScopes);
IScope currentBestScope = scopes.ToList()[i];
if (bestKnownQuality == null ||
max && qualities[i].Value > bestKnownQuality.Value
|| !max && qualities[i].Value < bestKnownQuality.Value) {
BestKnownQualityParameter.ActualValue = new DoubleValue(qualities[i].Value);
}
if (!results.ContainsKey(BestSolutionResultName)) {
var cloner = new Cloner();
//avoid cloning of subscopes
cloner.RegisterClonedObject(currentBestScope.SubScopes, new ScopeList());
var solution = cloner.Clone(currentBestScope);
results.Add(new Result(BestSolutionResultName, solution));
} else {
var bestSolution = (IScope)results[BestSolutionResultName].Value;
string qualityName = QualityParameter.TranslatedName;
if (bestSolution.Variables.ContainsKey(qualityName)) {
double bestQuality = ((DoubleValue)bestSolution.Variables[qualityName].Value).Value;
if (max && qualities[i].Value > bestQuality
|| !max && qualities[i].Value < bestQuality) {
var cloner = new Cloner();
//avoid cloning of subscopes
cloner.RegisterClonedObject(currentBestScope.SubScopes, new ScopeList());
var solution = cloner.Clone(currentBestScope);
results[BestSolutionResultName].Value = solution;
}
}
}
return base.Apply();
}
}
}