#region License Information
/* HeuristicLab
* Copyright (C) 2002-2010 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 HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Operators;
using HeuristicLab.Optimization;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using HeuristicLab.Problems.VehicleRouting.Interfaces;
using HeuristicLab.Problems.VehicleRouting.Variants;
using HeuristicLab.Common;
namespace HeuristicLab.Problems.VehicleRouting {
///
/// An operator for analyzing the best solution of Vehicle Routing Problems.
///
[Item("BestCapacitatedVRPSolutionAnalyzer", "An operator for analyzing the best solution of capacitated Vehicle Routing Problems.")]
[StorableClass]
public sealed class BestCapacitatedVRPSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, ICapacitatedOperator {
public ILookupParameter ProblemInstanceParameter {
get { return (ILookupParameter)Parameters["ProblemInstance"]; }
}
public ScopeTreeLookupParameter VRPToursParameter {
get { return (ScopeTreeLookupParameter)Parameters["VRPTours"]; }
}
public ScopeTreeLookupParameter QualityParameter {
get { return (ScopeTreeLookupParameter)Parameters["Quality"]; }
}
public ScopeTreeLookupParameter OverloadParameter {
get { return (ScopeTreeLookupParameter)Parameters["Overload"]; }
}
public LookupParameter BestSolutionParameter {
get { return (LookupParameter)Parameters["BestSolution"]; }
}
public ValueLookupParameter ResultsParameter {
get { return (ValueLookupParameter)Parameters["Results"]; }
}
public bool EnabledByDefault {
get { return true; }
}
[StorableConstructor]
private BestCapacitatedVRPSolutionAnalyzer(bool deserializing) : base(deserializing) { }
public BestCapacitatedVRPSolutionAnalyzer()
: base() {
Parameters.Add(new LookupParameter("ProblemInstance", "The problem instance."));
Parameters.Add(new ScopeTreeLookupParameter("VRPTours", "The VRP tours which should be evaluated."));
Parameters.Add(new ScopeTreeLookupParameter("Quality", "The qualities of the VRP solutions which should be analyzed."));
Parameters.Add(new ScopeTreeLookupParameter("Overload", "The overloads of the VRP solutions which should be analyzed."));
Parameters.Add(new LookupParameter("BestSolution", "The best VRP solution."));
Parameters.Add(new ValueLookupParameter("Results", "The result collection where the best VRP solution should be stored."));
}
public override IDeepCloneable Clone(Cloner cloner) {
return new BestCapacitatedVRPSolutionAnalyzer(this, cloner);
}
private BestCapacitatedVRPSolutionAnalyzer(BestCapacitatedVRPSolutionAnalyzer original, Cloner cloner)
: base(original, cloner) {
}
public override IOperation Apply() {
ItemArray solutions = VRPToursParameter.ActualValue;
ResultCollection results = ResultsParameter.ActualValue;
ItemArray qualities = QualityParameter.ActualValue;
ItemArray overloads = OverloadParameter.ActualValue;
int i = qualities.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
VRPSolution solution = BestSolutionParameter.ActualValue;
if (solution != null) {
if (!results.ContainsKey("Best VRP Solution Overload")) {
results.Add(new Result("Best VRP Solution Overload", new DoubleValue(overloads[i].Value)));
} else {
if (qualities[i].Value <= solution.Quality.Value) {
(results["Best VRP Solution Overload"].Value as DoubleValue).Value = overloads[i].Value;
}
}
}
return base.Apply();
}
}
}