| 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 |
|
|---|
| 22 | using HeuristicLab.Common;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Parameters;
|
|---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 27 | using HeuristicLab.Selection;
|
|---|
| 28 | using System.Linq;
|
|---|
| 29 |
|
|---|
| 30 | namespace HeuristicLab.Analysis.FitnessLandscape {
|
|---|
| 31 | [Item("Adaptive Walk", "An adaptive walk applies a certain manipulation operation always taking the best of the sample.")]
|
|---|
| 32 | [StorableClass]
|
|---|
| 33 | [Creatable(CreatableAttribute.Categories.TestingAndAnalysis + CreatableAttribute.Categories.SplitToken + "1" + CreatableAttribute.Categories.OrderToken + "FLA", Priority = 303)]
|
|---|
| 34 | public sealed class AdaptiveWalk : LocalAnalysis<BestSelector> {
|
|---|
| 35 |
|
|---|
| 36 | public IFixedValueParameter<IntValue> SampleSizeParameter {
|
|---|
| 37 | get { return (IFixedValueParameter<IntValue>)Parameters["SampleSize"]; }
|
|---|
| 38 | }
|
|---|
| 39 |
|
|---|
| 40 | [StorableConstructor]
|
|---|
| 41 | private AdaptiveWalk(bool deserializing) : base(deserializing) { }
|
|---|
| 42 | private AdaptiveWalk(AdaptiveWalk original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 43 | public AdaptiveWalk()
|
|---|
| 44 | : base(new BestSelector()) {
|
|---|
| 45 | SelectorParameter.Value.NumberOfSelectedSubScopesParameter.Hidden = true;
|
|---|
| 46 | Parameters.Add(new FixedValueParameter<IntValue>("SampleSize", "Number of sampled moves from which the adaptive walk chooses the best.", new IntValue(10)));
|
|---|
| 47 | var trailAnalyzer = AnalyzerParameter.Value.Operators.OfType<QualityTrailMultiAnalyzer>().Single();
|
|---|
| 48 | var upDown = trailAnalyzer.Operators.OfType<UpDownWalkAnalyzer>().Single();
|
|---|
| 49 | trailAnalyzer.Operators.SetItemCheckedState(upDown, false);
|
|---|
| 50 | }
|
|---|
| 51 |
|
|---|
| 52 | public override IDeepCloneable Clone(Cloner cloner) {
|
|---|
| 53 | return new AdaptiveWalk(this, cloner);
|
|---|
| 54 | }
|
|---|
| 55 | }
|
|---|
| 56 | }
|
|---|
