[14625] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2017 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.Threading;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
| 27 | using HeuristicLab.Optimization;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Networks.IntegratedOptimization.MachineLearning {
|
---|
| 31 | [StorableClass]
|
---|
[14675] | 32 | [Creatable("Optimization Networks")]
|
---|
[14625] | 33 | public sealed class OrchestratedBinaryProblem : SingleObjectiveBasicProblem<BinaryVectorEncoding> {
|
---|
| 34 |
|
---|
| 35 | [Storable]
|
---|
| 36 | private readonly bool maximization;
|
---|
| 37 | public override bool Maximization { get { return maximization; } }
|
---|
| 38 |
|
---|
| 39 | [Storable]
|
---|
| 40 | public FeatureSelectionOrchestrator Orchestrator { get; private set; }
|
---|
| 41 |
|
---|
| 42 | [StorableConstructor]
|
---|
| 43 | private OrchestratedBinaryProblem(bool deserializing) : base(deserializing) { }
|
---|
| 44 | private OrchestratedBinaryProblem(OrchestratedBinaryProblem original, Cloner cloner)
|
---|
| 45 | : base(original, cloner) {
|
---|
| 46 | this.maximization = original.maximization;
|
---|
| 47 | this.Orchestrator = cloner.Clone(original.Orchestrator);
|
---|
| 48 | }
|
---|
| 49 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 50 | return new OrchestratedBinaryProblem(this, cloner);
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public OrchestratedBinaryProblem(FeatureSelectionOrchestrator orchestator, int binaryVectorLength, bool maximization)
|
---|
| 54 | : base() {
|
---|
| 55 | Orchestrator = orchestator;
|
---|
| 56 | Encoding.Length = binaryVectorLength;
|
---|
| 57 | this.maximization = maximization;
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | public override double Evaluate(Individual individual, IRandom random) {
|
---|
| 61 | var msg = Orchestrator.FeatureSelectionEvaluationPort.PrepareMessage();
|
---|
| 62 | msg["BinaryVector"] = individual.BinaryVector();
|
---|
| 63 | Orchestrator.FeatureSelectionEvaluationPort.ReceiveMessage(msg, new CancellationToken());
|
---|
| 64 | var quality = (DoubleValue)msg["Quality"];
|
---|
| 65 | return quality.Value;
|
---|
| 66 | }
|
---|
| 67 | }
|
---|
| 68 | }
|
---|