#region License Information
/* HeuristicLab
* Copyright (C) 2002-2018 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 Google.OrTools.LinearSolver;
using HeuristicLab.Common;
using HeuristicLab.Common.Resources;
using HeuristicLab.Core;
using HeuristicLab.Optimization;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.MathematicalOptimization.LinearProgramming.Problems {
[Item("Linear Programming Programmable Problem (single-objective)", "Represents a single-objective problem that can be programmed with a script.")]
[Creatable(CreatableAttribute.Categories.Problems, Priority = 100)]
[StorableClass]
public class LinearProgrammingProblem : Problem, IProgrammableItem {
public new static Image StaticItemImage => VSImageLibrary.Script;
private FixedValueParameter LinearProgrammingProblemScriptParameter => (FixedValueParameter)Parameters["ProblemScript"];
public LinearProgrammingProblemDefinitionScript ProblemScript => LinearProgrammingProblemScriptParameter.Value;
public ILinearProgrammingProblemDefinition ProblemDefinition => LinearProgrammingProblemScriptParameter.Value;
private LinearProgrammingProblem(LinearProgrammingProblem original, Cloner cloner)
: base(original, cloner) {
RegisterEvents();
}
public override IDeepCloneable Clone(Cloner cloner) { return new LinearProgrammingProblem(this, cloner); }
[StorableConstructor]
private LinearProgrammingProblem(bool deserializing) : base(deserializing) { }
public LinearProgrammingProblem() {
Parameters.Add(new FixedValueParameter("ProblemScript", "Defines the problem.", new LinearProgrammingProblemDefinitionScript { Name = Name }) { GetsCollected = false });
//Operators.Add(new BestScopeSolutionAnalyzer());
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 FixedValueParameter("Maximization", "Set to false if the problem should be minimized.", (BoolValue)new BoolValue(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 void BuildModel(Solver solver) => ProblemDefinition.BuildModel(solver);
//public override bool Maximization {
// get { return Parameters.ContainsKey("ProblemScript") ? ProblemDefinition.Maximization : 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);
//}
//public override IEnumerable GetNeighbors(Individual individual, IRandom random) {
// return ProblemDefinition.GetNeighbors(individual, random);
//}
}
}