| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2011 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.Linq;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Operators;
|
|---|
| 26 | using HeuristicLab.Parameters;
|
|---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 28 |
|
|---|
| 29 | namespace HeuristicLab.Optimization.Operators.LCS {
|
|---|
| 30 | [Item("BestSolutionCreator", "Description missing")]
|
|---|
| 31 | [StorableClass]
|
|---|
| 32 | public class BestSolutionCreator : SingleSuccessorOperator {
|
|---|
| 33 |
|
|---|
| 34 | #region Parameter Properties
|
|---|
| 35 | public IValueLookupParameter<IGAssistSolution> SolutionParameter {
|
|---|
| 36 | get { return (IValueLookupParameter<IGAssistSolution>)Parameters["Solution"]; }
|
|---|
| 37 | }
|
|---|
| 38 | public ScopeTreeLookupParameter<IGAssistIndividual> IndividualParameter {
|
|---|
| 39 | get { return (ScopeTreeLookupParameter<IGAssistIndividual>)Parameters["Individual"]; }
|
|---|
| 40 | }
|
|---|
| 41 | public LookupParameter<IGAssistNichesProblemData> ProblemDataParameter {
|
|---|
| 42 | get { return (LookupParameter<IGAssistNichesProblemData>)Parameters["ProblemData"]; }
|
|---|
| 43 | }
|
|---|
| 44 | public IScopeTreeLookupParameter<DoubleValue> QualityParameter {
|
|---|
| 45 | get { return (IScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
|
|---|
| 46 | }
|
|---|
| 47 | public ILookupParameter<BoolValue> MaximizationParameter {
|
|---|
| 48 | get { return (ILookupParameter<BoolValue>)Parameters["Maximization"]; }
|
|---|
| 49 | }
|
|---|
| 50 | #endregion
|
|---|
| 51 |
|
|---|
| 52 | [StorableConstructor]
|
|---|
| 53 | protected BestSolutionCreator(bool deserializing) : base(deserializing) { }
|
|---|
| 54 | public BestSolutionCreator()
|
|---|
| 55 | : base() {
|
|---|
| 56 | Parameters.Add(new ValueLookupParameter<IGAssistIndividual>("Solution", ""));
|
|---|
| 57 | Parameters.Add(new ScopeTreeLookupParameter<IGAssistIndividual>("Individual", ""));
|
|---|
| 58 | Parameters.Add(new LookupParameter<IGAssistNichesProblemData>("ProblemData", ""));
|
|---|
| 59 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the trees that should be analyzed."));
|
|---|
| 60 | Parameters.Add(new LookupParameter<BoolValue>("Maximization", "The direction of optimization."));
|
|---|
| 61 | }
|
|---|
| 62 |
|
|---|
| 63 | public override IOperation Apply() {
|
|---|
| 64 | var qualities = QualityParameter.ActualValue;
|
|---|
| 65 | var bestQuality = MaximizationParameter.ActualValue.Value ? qualities.Max() : qualities.Min();
|
|---|
| 66 | int index = qualities.IndexOf(bestQuality);
|
|---|
| 67 | SolutionParameter.ActualValue = IndividualParameter.ActualValue[index].CreateGAssistSolution(ProblemDataParameter.ActualValue);
|
|---|
| 68 | return base.Apply();
|
|---|
| 69 | }
|
|---|
| 70 | }
|
|---|
| 71 | }
|
|---|
