1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2014 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 HeuristicLab.Analysis;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.Programmable {
|
---|
31 | [Item("One Max New", "Represents a single-objective problem that can be programmed.")]
|
---|
32 | [Creatable("1 Test")]
|
---|
33 | [StorableClass]
|
---|
34 | public class OneMaxNew : SingleObjectiveBasicProblem<BinaryEncoding> {
|
---|
35 | public override bool Maximization {
|
---|
36 | get { return true; }
|
---|
37 | }
|
---|
38 |
|
---|
39 | public OneMaxNew()
|
---|
40 | : base() {
|
---|
41 | Encoding = new BinaryEncoding("BinaryVector", 10);
|
---|
42 | var bestScopeSolutionAnalyzer = Operators.OfType<BestScopeSolutionAnalyzer>().FirstOrDefault();
|
---|
43 | if (bestScopeSolutionAnalyzer != null) Operators.Remove(bestScopeSolutionAnalyzer);
|
---|
44 | }
|
---|
45 |
|
---|
46 | [StorableConstructor]
|
---|
47 | protected OneMaxNew(bool deserializing) : base(deserializing) { }
|
---|
48 |
|
---|
49 | protected OneMaxNew(OneMaxNew original, Cloner cloner) : base(original, cloner) { }
|
---|
50 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
51 | return new OneMaxNew(this, cloner);
|
---|
52 | }
|
---|
53 | public override double Evaluate(Individual individual, IRandom random) {
|
---|
54 | return individual.BinaryVector().Count(b => b);
|
---|
55 | }
|
---|
56 |
|
---|
57 | public override void Analyze(Individual[] individuals, double[] qualities, ResultCollection results) {
|
---|
58 | base.Analyze(individuals, qualities, results);
|
---|
59 | var best = individuals.Zip(qualities, (i, q) => new { Individual = i, Quality = q }).OrderByDescending(z => z.Quality).First();
|
---|
60 | if (!results.ContainsKey("Best Solution")) {
|
---|
61 | results.Add(new Result("Best Solution", typeof(BinaryVector)));
|
---|
62 | }
|
---|
63 | results["Best Solution"].Value = best.Individual.BinaryVector();
|
---|
64 | }
|
---|
65 | }
|
---|
66 | }
|
---|