[15562] | 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 |
|
---|
[16728] | 22 | using HEAL.Attic;
|
---|
[15562] | 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Parameters;
|
---|
| 26 |
|
---|
[15698] | 27 | namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment.Algorithms.RandomSearch {
|
---|
| 28 | [Item("Random Search Context", "Context for random search algorithms.")]
|
---|
[16728] | 29 | [StorableType("49827D3F-3668-44C8-888B-5F5EB6769652")]
|
---|
[15698] | 30 | public sealed class RandomSearchContext : SingleSolutionContext<ISingleObjectiveSolutionScope<GQAPSolution>> {
|
---|
[15562] | 31 | [Storable]
|
---|
| 32 | private IValueParameter<GQAP> problem;
|
---|
| 33 | public GQAP Problem {
|
---|
| 34 | get { return problem.Value; }
|
---|
| 35 | set { problem.Value = value; }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | [Storable]
|
---|
| 39 | private IValueParameter<GQAPSolution> bestSolution;
|
---|
| 40 | public GQAPSolution BestSolution {
|
---|
| 41 | get { return bestSolution.Value; }
|
---|
| 42 | set { bestSolution.Value = value; }
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | [StorableConstructor]
|
---|
[16728] | 46 | private RandomSearchContext(StorableConstructorFlag _) : base(_) { }
|
---|
[15698] | 47 | private RandomSearchContext(RandomSearchContext original, Cloner cloner)
|
---|
[15562] | 48 | : base(original, cloner) {
|
---|
| 49 | problem = cloner.Clone(original.problem);
|
---|
| 50 | bestSolution = cloner.Clone(original.bestSolution);
|
---|
| 51 | }
|
---|
[15698] | 52 | public RandomSearchContext() {
|
---|
[15562] | 53 | Parameters.Add(problem = new ValueParameter<GQAP>("Problem"));
|
---|
| 54 | Parameters.Add(bestSolution = new ValueParameter<GQAPSolution>("BestFoundSolution"));
|
---|
| 55 | }
|
---|
| 56 |
|
---|
| 57 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[15698] | 58 | return new RandomSearchContext(this, cloner);
|
---|
[15562] | 59 | }
|
---|
| 60 |
|
---|
| 61 | public ISingleObjectiveSolutionScope<GQAPSolution> ToScope(GQAPSolution code, double fitness = double.NaN) {
|
---|
| 62 | var name = Problem.Encoding.Name;
|
---|
| 63 | var scope = new SingleObjectiveSolutionScope<GQAPSolution>(code,
|
---|
| 64 | name + "Solution", fitness, Problem.Evaluator.QualityParameter.ActualName) {
|
---|
| 65 | Parent = Scope
|
---|
| 66 | };
|
---|
| 67 | scope.Variables.Add(new Variable(name, code.Assignment));
|
---|
| 68 | scope.Variables.Add(new Variable("Evaluation", code.Evaluation));
|
---|
| 69 | return scope;
|
---|
| 70 | }
|
---|
| 71 | }
|
---|
| 72 | } |
---|