| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2010 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.Core;
|
|---|
| 23 | using HeuristicLab.Data;
|
|---|
| 24 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
|---|
| 25 | using HeuristicLab.Operators;
|
|---|
| 26 | using HeuristicLab.Optimization;
|
|---|
| 27 | using HeuristicLab.Parameters;
|
|---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 29 |
|
|---|
| 30 | namespace HeuristicLab.Problems.ArtificialAnt {
|
|---|
| 31 | [Item("ArtificialAntEvaluator", "Evaluates an artificial ant solution.")]
|
|---|
| 32 | [StorableClass]
|
|---|
| 33 | public class Evaluator : SingleSuccessorOperator, ISingleObjectiveEvaluator {
|
|---|
| 34 |
|
|---|
| 35 | public ILookupParameter<DoubleValue> QualityParameter {
|
|---|
| 36 | get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
|
|---|
| 37 | }
|
|---|
| 38 |
|
|---|
| 39 | public ILookupParameter<SymbolicExpressionTree> SymbolicExpressionTreeParameter {
|
|---|
| 40 | get { return (ILookupParameter<SymbolicExpressionTree>)Parameters["SymbolicExpressionTree"]; }
|
|---|
| 41 | }
|
|---|
| 42 | public ILookupParameter<BoolMatrix> WorldParameter {
|
|---|
| 43 | get { return (ILookupParameter<BoolMatrix>)Parameters["World"]; }
|
|---|
| 44 | }
|
|---|
| 45 | public ILookupParameter<IntValue> MaxTimeStepsParameter {
|
|---|
| 46 | get { return (ILookupParameter<IntValue>)Parameters["MaxTimeSteps"]; }
|
|---|
| 47 | }
|
|---|
| 48 |
|
|---|
| 49 | public Evaluator()
|
|---|
| 50 | : base() {
|
|---|
| 51 | Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality of the evaluated artificial ant solution."));
|
|---|
| 52 | Parameters.Add(new LookupParameter<SymbolicExpressionTree>("SymbolicExpressionTree", "The artificial ant solution encoded as a symbolic expression tree that should be evaluated"));
|
|---|
| 53 | Parameters.Add(new LookupParameter<BoolMatrix>("World", "The world for the artificial ant with scattered food items."));
|
|---|
| 54 | Parameters.Add(new LookupParameter<IntValue>("MaxTimeSteps", "The maximal number of time steps that the artificial ant should be simulated."));
|
|---|
| 55 | }
|
|---|
| 56 |
|
|---|
| 57 | public sealed override IOperation Apply() {
|
|---|
| 58 | SymbolicExpressionTree expression = SymbolicExpressionTreeParameter.ActualValue;
|
|---|
| 59 | BoolMatrix world = WorldParameter.ActualValue;
|
|---|
| 60 | IntValue maxTimeSteps = MaxTimeStepsParameter.ActualValue;
|
|---|
| 61 |
|
|---|
| 62 | AntInterpreter interpreter = new AntInterpreter();
|
|---|
| 63 | interpreter.MaxTimeSteps = maxTimeSteps.Value;
|
|---|
| 64 | interpreter.World = world;
|
|---|
| 65 | interpreter.Expression = expression;
|
|---|
| 66 | interpreter.Run();
|
|---|
| 67 |
|
|---|
| 68 | QualityParameter.ActualValue = new DoubleValue(interpreter.FoodEaten);
|
|---|
| 69 | return null;
|
|---|
| 70 | }
|
|---|
| 71 | }
|
|---|
| 72 | }
|
|---|
