[11990] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17209] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[11990] | 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;
|
---|
| 23 | using System.Linq;
|
---|
| 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
[16565] | 27 | using HEAL.Attic;
|
---|
[11990] | 28 |
|
---|
| 29 | namespace HeuristicLab.Problems.Binary {
|
---|
| 30 | [Item("One Max Problem", "Represents a problem whose objective is to maximize the number of true values.")]
|
---|
[12504] | 31 | [Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 210)]
|
---|
[16565] | 32 | [StorableType("A290ADDE-33F5-4607-ABC0-19349CD0FBF1")]
|
---|
[11990] | 33 | public class OneMaxProblem : BinaryProblem {
|
---|
| 34 | public override bool Maximization {
|
---|
| 35 | get { return true; }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | public OneMaxProblem()
|
---|
| 39 | : base() {
|
---|
[11996] | 40 | Encoding.Length = 10;
|
---|
| 41 | BestKnownQuality = Encoding.Length;
|
---|
[11990] | 42 | }
|
---|
| 43 |
|
---|
| 44 | [StorableConstructor]
|
---|
[16565] | 45 | protected OneMaxProblem(StorableConstructorFlag _) : base(_) { }
|
---|
[11990] | 46 |
|
---|
| 47 | protected OneMaxProblem(OneMaxProblem original, Cloner cloner) : base(original, cloner) { }
|
---|
| 48 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 49 | return new OneMaxProblem(this, cloner);
|
---|
| 50 | }
|
---|
| 51 |
|
---|
| 52 | public override double Evaluate(BinaryVector vector, IRandom random) {
|
---|
| 53 | return vector.Count(b => b);
|
---|
| 54 | }
|
---|
| 55 |
|
---|
| 56 | protected override void LengthParameter_ValueChanged(object sender, EventArgs e) {
|
---|
| 57 | base.LengthParameter_ValueChanged(sender, e);
|
---|
| 58 | BestKnownQuality = Length;
|
---|
| 59 | }
|
---|
| 60 | }
|
---|
| 61 | }
|
---|