[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 |
|
---|
[14450] | 22 | using System.Threading;
|
---|
| 23 | using HeuristicLab.Algorithms.MemPR.Interfaces;
|
---|
[14466] | 24 | using HeuristicLab.Algorithms.MemPR.Util;
|
---|
[14420] | 25 | using HeuristicLab.Common;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
[14466] | 27 | using HeuristicLab.Encodings.LinearLinkageEncoding;
|
---|
[14420] | 28 | using HeuristicLab.Optimization;
|
---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 30 |
|
---|
[14466] | 31 | namespace HeuristicLab.Algorithms.MemPR.LinearLinkage.LocalSearch {
|
---|
| 32 | [Item("Exhaustive Local (Subspace) Search (linear linkage)", "", ExcludeGenericTypeInfo = true)]
|
---|
[14420] | 33 | [StorableClass]
|
---|
[14466] | 34 | public class ExhaustiveSubspace<TContext> : NamedItem, ILocalSearch<TContext>
|
---|
| 35 | where TContext : ISingleSolutionHeuristicAlgorithmContext<SingleObjectiveBasicProblem<LinearLinkageEncoding>, Encodings.LinearLinkageEncoding.LinearLinkage>, ILinearLinkageSubspaceContext {
|
---|
[14420] | 36 |
|
---|
| 37 | [StorableConstructor]
|
---|
[14466] | 38 | protected ExhaustiveSubspace(bool deserializing) : base(deserializing) { }
|
---|
| 39 | protected ExhaustiveSubspace(ExhaustiveSubspace<TContext> original, Cloner cloner) : base(original, cloner) { }
|
---|
| 40 | public ExhaustiveSubspace() {
|
---|
[14450] | 41 | Name = ItemName;
|
---|
| 42 | Description = ItemDescription;
|
---|
| 43 | }
|
---|
[14420] | 44 |
|
---|
| 45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[14466] | 46 | return new ExhaustiveSubspace<TContext>(this, cloner);
|
---|
[14420] | 47 | }
|
---|
| 48 |
|
---|
| 49 | public void Optimize(TContext context) {
|
---|
[14466] | 50 | var evalWrapper = new EvaluationWrapper<Encodings.LinearLinkageEncoding.LinearLinkage>(context.Problem, context.Solution);
|
---|
[14420] | 51 | var quality = context.Solution.Fitness;
|
---|
| 52 | try {
|
---|
[14466] | 53 | var result = ExhaustiveLocalSearch.Optimize(context.Random, context.Solution.Solution, ref quality,
|
---|
[14450] | 54 | context.Problem.Maximization, evalWrapper.Evaluate, CancellationToken.None, context.Subspace.Subspace);
|
---|
| 55 | context.IncrementEvaluatedSolutions(result.Item1);
|
---|
[14420] | 56 | context.Iterations = result.Item2;
|
---|
| 57 | } finally {
|
---|
| 58 | context.Solution.Fitness = quality;
|
---|
| 59 | }
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 | }
|
---|