[6266] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2011 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 |
|
---|
[6406] | 22 | using HeuristicLab.Common;
|
---|
[6266] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
[6406] | 25 | using HeuristicLab.Encodings.ScheduleEncoding;
|
---|
| 26 | using HeuristicLab.Operators;
|
---|
[6266] | 27 | using HeuristicLab.Parameters;
|
---|
[6406] | 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[6266] | 29 |
|
---|
| 30 |
|
---|
[6406] | 31 | namespace HeuristicLab.Problems.Scheduling {
|
---|
[6364] | 32 | [Item("Scheduling Evaluator", "Represents a evaluator class for standard scheduling problems.")]
|
---|
[6266] | 33 | [StorableClass]
|
---|
[6406] | 34 | public abstract class SchedulingEvaluator : SingleSuccessorOperator, IScheduleEvaluator {
|
---|
[6266] | 35 | [StorableConstructor]
|
---|
| 36 | protected SchedulingEvaluator(bool deserializing) : base(deserializing) { }
|
---|
| 37 | protected SchedulingEvaluator(SchedulingEvaluator original, Cloner cloner)
|
---|
| 38 | : base(original, cloner) {
|
---|
| 39 | }
|
---|
| 40 |
|
---|
| 41 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 42 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 43 | }
|
---|
| 44 | public ILookupParameter<DoubleValue> QualityParameter {
|
---|
[6406] | 45 | get {
|
---|
[6266] | 46 | if (Parameters.ContainsKey("Quality"))
|
---|
| 47 | return (ILookupParameter<DoubleValue>)Parameters["Quality"];
|
---|
| 48 | else
|
---|
| 49 | return null;
|
---|
| 50 | }
|
---|
| 51 | }
|
---|
[6406] | 52 | public ILookupParameter<Schedule> ScheduleParameter {
|
---|
| 53 | get { return (ILookupParameter<Schedule>)Parameters["Schedule"]; }
|
---|
[6266] | 54 | }
|
---|
| 55 |
|
---|
[6406] | 56 | public SchedulingEvaluator()
|
---|
| 57 | : base() {
|
---|
[6266] | 58 | Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality value aka fitness value of the solution."));
|
---|
[6406] | 59 | Parameters.Add(new LookupParameter<Schedule>("Schedule", "The decoded scheduling solution represented as generalized schedule."));
|
---|
[6266] | 60 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator."));
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | protected abstract DoubleValue evaluate(Schedule schedule);
|
---|
[6406] | 64 |
|
---|
[6266] | 65 | public override IOperation Apply() {
|
---|
[6406] | 66 | Schedule schedule = ScheduleParameter.ActualValue;
|
---|
| 67 | QualityParameter.ActualValue = evaluate(schedule);
|
---|
[6266] | 68 | return base.Apply();
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|