[5578] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17246] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5578] | 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;
|
---|
[16662] | 26 | using HEAL.Attic;
|
---|
[5578] | 27 |
|
---|
| 28 | namespace HeuristicLab.Optimization {
|
---|
| 29 | [Item("Multi-Objective Heuristic Optimization Problem", "A base class for multi-objective heuristic optimization problems.")]
|
---|
[16662] | 30 | [StorableType("C46643E3-7144-4884-A30A-5329BD80DC4E")]
|
---|
[5578] | 31 | public abstract class MultiObjectiveHeuristicOptimizationProblem<T, U> : HeuristicOptimizationProblem<T, U>, IMultiObjectiveHeuristicOptimizationProblem
|
---|
| 32 | where T : class, IMultiObjectiveEvaluator
|
---|
| 33 | where U : class, ISolutionCreator {
|
---|
| 34 | private const string MaximizationParameterName = "Maximization";
|
---|
| 35 |
|
---|
| 36 | [StorableConstructor]
|
---|
[16662] | 37 | protected MultiObjectiveHeuristicOptimizationProblem(StorableConstructorFlag _) : base(_) { }
|
---|
[5578] | 38 | protected MultiObjectiveHeuristicOptimizationProblem(MultiObjectiveHeuristicOptimizationProblem<T, U> original, Cloner cloner) : base(original, cloner) { }
|
---|
| 39 | protected MultiObjectiveHeuristicOptimizationProblem()
|
---|
| 40 | : base() {
|
---|
| 41 | Parameters.Add(new ValueParameter<BoolArray>(MaximizationParameterName, "Determines for each objective whether it should be maximized or minimized."));
|
---|
| 42 | }
|
---|
| 43 |
|
---|
[5618] | 44 | protected MultiObjectiveHeuristicOptimizationProblem(T evaluator, U solutionCreator)
|
---|
| 45 | : base(evaluator, solutionCreator) {
|
---|
| 46 | Parameters.Add(new ValueParameter<BoolArray>(MaximizationParameterName, "Determines for each objective whether it should be maximized or minimized."));
|
---|
| 47 | }
|
---|
| 48 |
|
---|
[5578] | 49 | public ValueParameter<BoolArray> MaximizationParameter {
|
---|
| 50 | get { return (ValueParameter<BoolArray>)Parameters[MaximizationParameterName]; }
|
---|
| 51 | }
|
---|
| 52 | IParameter IMultiObjectiveHeuristicOptimizationProblem.MaximizationParameter {
|
---|
| 53 | get { return MaximizationParameter; }
|
---|
| 54 | }
|
---|
| 55 | public BoolArray Maximization {
|
---|
| 56 | get { return MaximizationParameter.Value; }
|
---|
| 57 | protected set { MaximizationParameter.Value = value; }
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | IMultiObjectiveEvaluator IMultiObjectiveHeuristicOptimizationProblem.Evaluator {
|
---|
| 61 | get { return Evaluator; }
|
---|
| 62 | }
|
---|
| 63 | }
|
---|
| 64 | }
|
---|