[14420] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2016 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 |
|
---|
[14552] | 22 | using System;
|
---|
| 23 | using System.Runtime.Remoting.Contexts;
|
---|
[14450] | 24 | using HeuristicLab.Algorithms.MemPR.Interfaces;
|
---|
[14691] | 25 | using HeuristicLab.Analysis.FitnessLandscape;
|
---|
[14420] | 26 | using HeuristicLab.Common;
|
---|
| 27 | using HeuristicLab.Core;
|
---|
[14450] | 28 | using HeuristicLab.Encodings.PermutationEncoding;
|
---|
[14420] | 29 | using HeuristicLab.Optimization;
|
---|
| 30 | using HeuristicLab.Parameters;
|
---|
| 31 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 32 |
|
---|
[14450] | 33 | namespace HeuristicLab.Algorithms.MemPR.Permutation {
|
---|
| 34 | [Item("MemPR Population Context (permutation)", "MemPR population context for permutation encoded problems.")]
|
---|
[14420] | 35 | [StorableClass]
|
---|
[14552] | 36 | public sealed class PermutationMemPRPopulationContext : MemPRPopulationContext<ISingleObjectiveHeuristicOptimizationProblem, Encodings.PermutationEncoding.Permutation, PermutationMemPRPopulationContext, PermutationMemPRSolutionContext> {
|
---|
[14420] | 37 |
|
---|
| 38 | [StorableConstructor]
|
---|
[14450] | 39 | private PermutationMemPRPopulationContext(bool deserializing) : base(deserializing) { }
|
---|
| 40 | private PermutationMemPRPopulationContext(PermutationMemPRPopulationContext original, Cloner cloner)
|
---|
[14420] | 41 | : base(original, cloner) { }
|
---|
[14450] | 42 | public PermutationMemPRPopulationContext() : base("PermutationMemPRPopulationContext") { }
|
---|
| 43 | public PermutationMemPRPopulationContext(string name) : base(name) { }
|
---|
[14420] | 44 |
|
---|
| 45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[14450] | 46 | return new PermutationMemPRPopulationContext(this, cloner);
|
---|
[14420] | 47 | }
|
---|
| 48 |
|
---|
[14450] | 49 | public override PermutationMemPRSolutionContext CreateSingleSolutionContext(ISingleObjectiveSolutionScope<Encodings.PermutationEncoding.Permutation> solution) {
|
---|
| 50 | return new PermutationMemPRSolutionContext(this, solution);
|
---|
[14420] | 51 | }
|
---|
[14552] | 52 |
|
---|
| 53 | public override ISingleObjectiveSolutionScope<Encodings.PermutationEncoding.Permutation> ToScope(Encodings.PermutationEncoding.Permutation code, double fitness = double.NaN) {
|
---|
| 54 | var creator = Problem.SolutionCreator as IPermutationCreator;
|
---|
| 55 | if (creator == null) throw new InvalidOperationException("Can only solve binary encoded problems with MemPR (binary)");
|
---|
| 56 | return new SingleObjectiveSolutionScope<Encodings.PermutationEncoding.Permutation>(code, creator.PermutationParameter.ActualName, fitness, Problem.Evaluator.QualityParameter.ActualName) {
|
---|
| 57 | Parent = Scope
|
---|
| 58 | };
|
---|
| 59 | }
|
---|
[14420] | 60 | }
|
---|
| 61 |
|
---|
[14450] | 62 | [Item("MemPR Solution Context (permutation)", "MemPR solution context for permutation encoded problems.")]
|
---|
[14420] | 63 | [StorableClass]
|
---|
[14691] | 64 | public sealed class PermutationMemPRSolutionContext : MemPRSolutionContext<ISingleObjectiveHeuristicOptimizationProblem, Encodings.PermutationEncoding.Permutation, PermutationMemPRPopulationContext, PermutationMemPRSolutionContext>, IPermutationSubspaceContext,
|
---|
| 65 | ILocalSearchPathContext<Encodings.PermutationEncoding.Permutation> {
|
---|
[14420] | 66 |
|
---|
| 67 | [Storable]
|
---|
[14450] | 68 | private IValueParameter<PermutationSolutionSubspace> subspace;
|
---|
| 69 | public PermutationSolutionSubspace Subspace {
|
---|
[14420] | 70 | get { return subspace.Value; }
|
---|
| 71 | }
|
---|
[14450] | 72 | ISolutionSubspace<Encodings.PermutationEncoding.Permutation> ISolutionSubspaceContext<Encodings.PermutationEncoding.Permutation>.Subspace {
|
---|
[14420] | 73 | get { return Subspace; }
|
---|
| 74 | }
|
---|
| 75 |
|
---|
| 76 | [StorableConstructor]
|
---|
[14450] | 77 | private PermutationMemPRSolutionContext(bool deserializing) : base(deserializing) { }
|
---|
| 78 | private PermutationMemPRSolutionContext(PermutationMemPRSolutionContext original, Cloner cloner)
|
---|
[14420] | 79 | : base(original, cloner) {
|
---|
| 80 |
|
---|
| 81 | }
|
---|
[14450] | 82 | public PermutationMemPRSolutionContext(PermutationMemPRPopulationContext baseContext, ISingleObjectiveSolutionScope<Encodings.PermutationEncoding.Permutation> solution)
|
---|
[14420] | 83 | : base(baseContext, solution) {
|
---|
| 84 |
|
---|
[14450] | 85 | Parameters.Add(subspace = new ValueParameter<PermutationSolutionSubspace>("Subspace", new PermutationSolutionSubspace(null)));
|
---|
[14420] | 86 | }
|
---|
| 87 |
|
---|
| 88 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[14450] | 89 | return new PermutationMemPRSolutionContext(this, cloner);
|
---|
[14420] | 90 | }
|
---|
[14691] | 91 |
|
---|
| 92 | public DirectedPath<Encodings.PermutationEncoding.Permutation> LocalSearchPaths {
|
---|
| 93 | get { return BaseContext.LocalSearchPaths; }
|
---|
| 94 | }
|
---|
[14420] | 95 | }
|
---|
| 96 | }
|
---|