#region License Information /* HeuristicLab * Copyright (C) 2002-2016 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 . */ #endregion using System.Drawing; using HeuristicLab.Common; using HeuristicLab.Common.Resources; using HeuristicLab.Core; using HeuristicLab.Data; using HeuristicLab.Optimization; using HeuristicLab.Parameters; using HeuristicLab.Persistence; namespace HeuristicLab.Problems.Programmable { [Item("Programmable Problem (multi-objective)", "Represents a multi-objective problem that can be programmed with a script.")] [Creatable(CreatableAttribute.Categories.Problems, Priority = 120)] [StorableType("916c5220-35ef-4e40-9731-7e30ed94ba5c")] public sealed class MultiObjectiveProgrammableProblem : MultiObjectiveBasicProblem, IProgrammableItem { public static new Image StaticItemImage { get { return VSImageLibrary.Script; } } private FixedValueParameter MultiObjectiveProblemScriptParameter { get { return (FixedValueParameter)Parameters["ProblemScript"]; } } public MultiObjectiveProblemDefinitionScript ProblemScript { get { return MultiObjectiveProblemScriptParameter.Value; } } public IMultiObjectiveProblemDefinition ProblemDefinition { get { return MultiObjectiveProblemScriptParameter.Value; } } private MultiObjectiveProgrammableProblem(MultiObjectiveProgrammableProblem original, Cloner cloner) : base(original, cloner) { RegisterEvents(); } public override IDeepCloneable Clone(Cloner cloner) { return new MultiObjectiveProgrammableProblem(this, cloner); } [StorableConstructor] private MultiObjectiveProgrammableProblem(StorableConstructorFlag deserializing) : base(deserializing) { } public MultiObjectiveProgrammableProblem() : base() { Parameters.Add(new FixedValueParameter("ProblemScript", "Defines the problem.", new MultiObjectiveProblemDefinitionScript() { Name = Name })); RegisterEvents(); } [StorableHook(HookType.AfterDeserialization)] private void AfterDeserialization() { RegisterEvents(); } private void RegisterEvents() { ProblemScript.ProblemDefinitionChanged += (o, e) => OnProblemDefinitionChanged(); ProblemScript.NameChanged += (o, e) => OnProblemScriptNameChanged(); } private void OnProblemDefinitionChanged() { Parameters.Remove("Maximization"); Parameters.Add(new ValueParameter("Maximization", "Set to false if the problem should be minimized.", (BoolArray)new BoolArray(Maximization).AsReadOnly()) { Hidden = true }); Encoding = ProblemDefinition.Encoding; OnOperatorsChanged(); OnReset(); } protected override void OnNameChanged() { base.OnNameChanged(); ProblemScript.Name = Name; } private void OnProblemScriptNameChanged() { Name = ProblemScript.Name; } public override bool[] Maximization { get { return Parameters.ContainsKey("ProblemScript") ? ProblemDefinition.Maximization : new[] { false }; } } public override double[] Evaluate(Individual individual, IRandom random) { return ProblemDefinition.Evaluate(individual, random); } public override void Analyze(Individual[] individuals, double[][] qualities, ResultCollection results, IRandom random) { ProblemDefinition.Analyze(individuals, qualities, results, random); } } }