1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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 System.Linq;
|
---|
23 | using System.Threading;
|
---|
24 | using HEAL.Attic;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Data;
|
---|
28 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
29 | using HeuristicLab.Optimization;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Problems.Binary {
|
---|
32 | [Item("One Max Problem", "Represents a problem whose objective is to maximize the number of true values.")]
|
---|
33 | [Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 210)]
|
---|
34 | [StorableType("A290ADDE-33F5-4607-ABC0-19349CD0FBF1")]
|
---|
35 | public class OneMaxProblem : BinaryVectorProblem {
|
---|
36 |
|
---|
37 | public OneMaxProblem() : base() {
|
---|
38 | Maximization = true;
|
---|
39 | DimensionRefParameter.ForceValue(new IntValue(10, @readonly: false));
|
---|
40 | BestKnownQuality = Dimension;
|
---|
41 | }
|
---|
42 |
|
---|
43 | public override ISingleObjectiveEvaluationResult Evaluate(BinaryVector vector, IRandom random, CancellationToken cancellationToken) {
|
---|
44 | var quality = vector.Count(b => b);
|
---|
45 | return new SingleObjectiveEvaluationResult(quality);
|
---|
46 | }
|
---|
47 |
|
---|
48 | [StorableConstructor]
|
---|
49 | protected OneMaxProblem(StorableConstructorFlag _) : base(_) { }
|
---|
50 | protected OneMaxProblem(OneMaxProblem original, Cloner cloner) : base(original, cloner) { }
|
---|
51 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
52 | return new OneMaxProblem(this, cloner);
|
---|
53 | }
|
---|
54 |
|
---|
55 | protected override void DimensionOnChanged() {
|
---|
56 | base.DimensionOnChanged();
|
---|
57 | BestKnownQuality = Dimension;
|
---|
58 | }
|
---|
59 | }
|
---|
60 | }
|
---|