source: branches/OptimizationNetworks/HeuristicLab.Networks.IntegratedOptimization/3.3/MinimizationVariegationProblem.cs @ 14628

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2017 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 HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Optimization;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.Networks.IntegratedOptimization {
  [Item("Minimization Variegation Problem", "")]
  [StorableClass]
  public class MinimizationVariegationProblem<TEncoding> : SingleObjectiveBasicProblem<TEncoding> where TEncoding : class, IEncoding {
    public override bool Maximization {
      get { return false; }
    }

    [StorableConstructor]
    protected MinimizationVariegationProblem(bool deserializing) : base(deserializing) { }
    protected MinimizationVariegationProblem(MinimizationVariegationProblem<TEncoding> original, Cloner cloner) : base(original, cloner) { }
    public MinimizationVariegationProblem() : base() { }

    public override IDeepCloneable Clone(Cloner cloner) {
      return new MinimizationVariegationProblem<TEncoding>(this, cloner);
    }

    public override double Evaluate(Individual individual, IRandom random) { return 0.0; }
  }
}