source: branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/New/OneMaxNew.cs @ 11786

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System.Linq;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.Problems.Programmable.Problems {
  [Item("One Max New", "Represents a single-objective problem that can be programmed.")]
  [Creatable("1 Test")]
  [StorableClass]
  public class OneMaxNew : SingleObjectiveProgrammableProblem<BinaryEncoding> {
    public override bool Maximization {
      get { return true; }
    }

    public OneMaxNew()
      : base() {
      Encoding = new BinaryEncoding("BinaryVector", 10);
    }

    [StorableConstructor]
    protected OneMaxNew(bool deserializing) : base(deserializing) { }

    protected OneMaxNew(OneMaxNew original, Cloner cloner) : base(original, cloner) { }
    public override IDeepCloneable Clone(Cloner cloner) {
      return new OneMaxNew(this, cloner);
    }
    public override double Evaluate(Individual individual, IRandom random) {
      return individual.BinaryVector("BinaryVector").Count(b => b);
    }


  }
}